{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LQTZ54NEJHL2QOHVC43RO4VPKX","short_pith_number":"pith:LQTZ54NE","canonical_record":{"source":{"id":"1409.3881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-09-12T22:40:38Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"cd7473dfe02cc30d667ee2ac3ac06d38fa151fde13bc1f5f24e2d445f6ca34cd","abstract_canon_sha256":"179a38750af128d80f769044a4ea695ae4dad7f659fd19d93fac90e654b36b08"},"schema_version":"1.0"},"canonical_sha256":"5c279ef1a449d7a838f517371772af55f92b9f1688be8b0365136a3dd19ab5ff","source":{"kind":"arxiv","id":"1409.3881","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3881","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3881v1","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3881","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"LQTZ54NEJHL2","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LQTZ54NEJHL2QOHV","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LQTZ54NE","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LQTZ54NEJHL2QOHVC43RO4VPKX","target":"record","payload":{"canonical_record":{"source":{"id":"1409.3881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-09-12T22:40:38Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"cd7473dfe02cc30d667ee2ac3ac06d38fa151fde13bc1f5f24e2d445f6ca34cd","abstract_canon_sha256":"179a38750af128d80f769044a4ea695ae4dad7f659fd19d93fac90e654b36b08"},"schema_version":"1.0"},"canonical_sha256":"5c279ef1a449d7a838f517371772af55f92b9f1688be8b0365136a3dd19ab5ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:53.458589Z","signature_b64":"lVglq55ScdFheu9bTZ1pbzTV8wYx8W9300HlFrGkOPPFV8Gz2NzfcfEU9A3FKROR/v22jnUt09XXyXoqHbkXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c279ef1a449d7a838f517371772af55f92b9f1688be8b0365136a3dd19ab5ff","last_reissued_at":"2026-05-18T02:42:53.458141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:53.458141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.3881","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-18T02:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rldqdC8IifvwIboOzPmLzadndXfPoyvy7rf6sIbeBAtnbfW3zO7VYi29ku3xLwv+mI/N+UcvMC6AdRE4T4xOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:39:18.694838Z"},"content_sha256":"d530eb0999f473a5a5bf0337dde68957087085091598514d460b741b56cdef60","schema_version":"1.0","event_id":"sha256:d530eb0999f473a5a5bf0337dde68957087085091598514d460b741b56cdef60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LQTZ54NEJHL2QOHVC43RO4VPKX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Approach to Reducing Annotation Costs for BioNLP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"K. Vijay-Shanker, Michael Bloodgood","submitted_at":"2014-09-12T22:40:38Z","abstract_excerpt":"There is a broad range of BioNLP tasks for which active learning (AL) can significantly reduce annotation costs and a specific AL algorithm we have developed is particularly effective in reducing annotation costs for these tasks. We have previously developed an AL algorithm called ClosestInitPA that works best with tasks that have the following characteristics: redundancy in training material, burdensome annotation costs, Support Vector Machines (SVMs) work well for the task, and imbalanced datasets (i.e. when set up as a binary classification problem, one class is substantially rarer than the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3881","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-18T02:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kjYEduaeeJ4QYw0vOSn8wTo/MERZoqwgLFnDcz8hpG2kWcuaeKP44Utzp7nFEJJ5a+KzR1/7VNeGZycU78xSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:39:18.695190Z"},"content_sha256":"24db8c06e1f81db2c3c4ec5892c3dcb4434781002a5cd8f4d3b60e0e18801136","schema_version":"1.0","event_id":"sha256:24db8c06e1f81db2c3c4ec5892c3dcb4434781002a5cd8f4d3b60e0e18801136"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQTZ54NEJHL2QOHVC43RO4VPKX/bundle.json","state_url":"https://pith.science/pith/LQTZ54NEJHL2QOHVC43RO4VPKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQTZ54NEJHL2QOHVC43RO4VPKX/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-28T05:39:18Z","links":{"resolver":"https://pith.science/pith/LQTZ54NEJHL2QOHVC43RO4VPKX","bundle":"https://pith.science/pith/LQTZ54NEJHL2QOHVC43RO4VPKX/bundle.json","state":"https://pith.science/pith/LQTZ54NEJHL2QOHVC43RO4VPKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQTZ54NEJHL2QOHVC43RO4VPKX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LQTZ54NEJHL2QOHVC43RO4VPKX","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":"179a38750af128d80f769044a4ea695ae4dad7f659fd19d93fac90e654b36b08","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-09-12T22:40:38Z","title_canon_sha256":"cd7473dfe02cc30d667ee2ac3ac06d38fa151fde13bc1f5f24e2d445f6ca34cd"},"schema_version":"1.0","source":{"id":"1409.3881","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3881","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3881v1","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3881","created_at":"2026-05-18T02:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"LQTZ54NEJHL2","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LQTZ54NEJHL2QOHV","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LQTZ54NE","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:24db8c06e1f81db2c3c4ec5892c3dcb4434781002a5cd8f4d3b60e0e18801136","target":"graph","created_at":"2026-05-18T02:42:53Z","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":"There is a broad range of BioNLP tasks for which active learning (AL) can significantly reduce annotation costs and a specific AL algorithm we have developed is particularly effective in reducing annotation costs for these tasks. We have previously developed an AL algorithm called ClosestInitPA that works best with tasks that have the following characteristics: redundancy in training material, burdensome annotation costs, Support Vector Machines (SVMs) work well for the task, and imbalanced datasets (i.e. when set up as a binary classification problem, one class is substantially rarer than the","authors_text":"K. Vijay-Shanker, Michael Bloodgood","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-09-12T22:40:38Z","title":"An Approach to Reducing Annotation Costs for BioNLP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3881","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:d530eb0999f473a5a5bf0337dde68957087085091598514d460b741b56cdef60","target":"record","created_at":"2026-05-18T02:42:53Z","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":"179a38750af128d80f769044a4ea695ae4dad7f659fd19d93fac90e654b36b08","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2014-09-12T22:40:38Z","title_canon_sha256":"cd7473dfe02cc30d667ee2ac3ac06d38fa151fde13bc1f5f24e2d445f6ca34cd"},"schema_version":"1.0","source":{"id":"1409.3881","kind":"arxiv","version":1}},"canonical_sha256":"5c279ef1a449d7a838f517371772af55f92b9f1688be8b0365136a3dd19ab5ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c279ef1a449d7a838f517371772af55f92b9f1688be8b0365136a3dd19ab5ff","first_computed_at":"2026-05-18T02:42:53.458141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:53.458141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lVglq55ScdFheu9bTZ1pbzTV8wYx8W9300HlFrGkOPPFV8Gz2NzfcfEU9A3FKROR/v22jnUt09XXyXoqHbkXAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:53.458589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3881","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d530eb0999f473a5a5bf0337dde68957087085091598514d460b741b56cdef60","sha256:24db8c06e1f81db2c3c4ec5892c3dcb4434781002a5cd8f4d3b60e0e18801136"],"state_sha256":"14de5c99ded824fc647055775b3fc6ebebe243a29252ce3fd1b0cdf2eadced8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQLhCtuR7YqMdxV8giHTFK/XOT/ByIkVi/jOewgai3xpGmAFO7Mem8mt3RiH+gK7aesEInw4TAtPgO/jy+7MDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:39:18.697153Z","bundle_sha256":"b147e7bc8ef9e036c878d703b92d66a663e621b25438ae5f7655d88879530796"}}