{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RR6QHSIEFQDYO76C4WFPPAZE6O","short_pith_number":"pith:RR6QHSIE","canonical_record":{"source":{"id":"1811.01237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-03T15:50:27Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"0c17b63463b0100bd95e96194fff14a120ad0de36f21cdb6b43ecb4fa5f0e4ec","abstract_canon_sha256":"79a10f6799a50dcc156f8b5f869c4e94e92e6ba448644613e74d7ee7492149d8"},"schema_version":"1.0"},"canonical_sha256":"8c7d03c9042c07877fc2e58af78324f3b232f07afb652328ff584067887d5b26","source":{"kind":"arxiv","id":"1811.01237","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01237","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01237v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01237","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"RR6QHSIEFQDY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RR6QHSIEFQDYO76C","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RR6QHSIE","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RR6QHSIEFQDYO76C4WFPPAZE6O","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-03T15:50:27Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"0c17b63463b0100bd95e96194fff14a120ad0de36f21cdb6b43ecb4fa5f0e4ec","abstract_canon_sha256":"79a10f6799a50dcc156f8b5f869c4e94e92e6ba448644613e74d7ee7492149d8"},"schema_version":"1.0"},"canonical_sha256":"8c7d03c9042c07877fc2e58af78324f3b232f07afb652328ff584067887d5b26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:34.877038Z","signature_b64":"KZ0hD3IzO7V/18OPPwEbPvIzhrpAIveq/YPN+JxFNvO5dqe5ZsTcKlJWXCC+IPOkLUccEvxIDf4+Zh1o/3vfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c7d03c9042c07877fc2e58af78324f3b232f07afb652328ff584067887d5b26","last_reissued_at":"2026-05-18T00:01:34.876201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:34.876201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01237","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:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vjk7dQRgZ3b0ptlA8eENun//ttIxnmxHZR8CNieTLUWuDRVndsNgs9/V1i4fPnhybLlmcQRNcWLw/rlJ1sM3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:00:25.631693Z"},"content_sha256":"a8e1e0069f6fb11aefefc1dad57c739d8378fea99d77f7b6b4961c0f8cc22674","schema_version":"1.0","event_id":"sha256:a8e1e0069f6fb11aefefc1dad57c739d8378fea99d77f7b6b4961c0f8cc22674"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RR6QHSIEFQDYO76C4WFPPAZE6O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relation Mention Extraction from Noisy Data with Hierarchical Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Jun Feng, Minlie Huang, Xiaoyan Zhu, Yang Yang, Yijie Zhang","submitted_at":"2018-11-03T15:50:27Z","abstract_excerpt":"In this paper we address a task of relation mention extraction from noisy data: extracting representative phrases for a particular relation from noisy sentences that are collected via distant supervision. Despite its significance and value in many downstream applications, this task is less studied on noisy data. The major challenges exists in 1) the lack of annotation on mention phrases, and more severely, 2) handling noisy sentences which do not express a relation at all. To address the two challenges, we formulate the task as a semi-Markov decision process and propose a novel hierarchical re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01237","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:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yH3KplKSh6RpI40/8BRJ19xt8v6Cisw3PuGxXyJZusa5zOHFYW4B+9kJgNISC5oxs92t+SVvvuar9zoxX6K3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:00:25.632068Z"},"content_sha256":"932be2049b70f941b0ea377db68c3740a32cc204990776d391247582c193df11","schema_version":"1.0","event_id":"sha256:932be2049b70f941b0ea377db68c3740a32cc204990776d391247582c193df11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RR6QHSIEFQDYO76C4WFPPAZE6O/bundle.json","state_url":"https://pith.science/pith/RR6QHSIEFQDYO76C4WFPPAZE6O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RR6QHSIEFQDYO76C4WFPPAZE6O/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-02T23:00:25Z","links":{"resolver":"https://pith.science/pith/RR6QHSIEFQDYO76C4WFPPAZE6O","bundle":"https://pith.science/pith/RR6QHSIEFQDYO76C4WFPPAZE6O/bundle.json","state":"https://pith.science/pith/RR6QHSIEFQDYO76C4WFPPAZE6O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RR6QHSIEFQDYO76C4WFPPAZE6O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RR6QHSIEFQDYO76C4WFPPAZE6O","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":"79a10f6799a50dcc156f8b5f869c4e94e92e6ba448644613e74d7ee7492149d8","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-03T15:50:27Z","title_canon_sha256":"0c17b63463b0100bd95e96194fff14a120ad0de36f21cdb6b43ecb4fa5f0e4ec"},"schema_version":"1.0","source":{"id":"1811.01237","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01237","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01237v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01237","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"RR6QHSIEFQDY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RR6QHSIEFQDYO76C","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RR6QHSIE","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:932be2049b70f941b0ea377db68c3740a32cc204990776d391247582c193df11","target":"graph","created_at":"2026-05-18T00:01:34Z","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":"In this paper we address a task of relation mention extraction from noisy data: extracting representative phrases for a particular relation from noisy sentences that are collected via distant supervision. Despite its significance and value in many downstream applications, this task is less studied on noisy data. The major challenges exists in 1) the lack of annotation on mention phrases, and more severely, 2) handling noisy sentences which do not express a relation at all. To address the two challenges, we formulate the task as a semi-Markov decision process and propose a novel hierarchical re","authors_text":"Jun Feng, Minlie Huang, Xiaoyan Zhu, Yang Yang, Yijie Zhang","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-03T15:50:27Z","title":"Relation Mention Extraction from Noisy Data with Hierarchical Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01237","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:a8e1e0069f6fb11aefefc1dad57c739d8378fea99d77f7b6b4961c0f8cc22674","target":"record","created_at":"2026-05-18T00:01:34Z","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":"79a10f6799a50dcc156f8b5f869c4e94e92e6ba448644613e74d7ee7492149d8","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-03T15:50:27Z","title_canon_sha256":"0c17b63463b0100bd95e96194fff14a120ad0de36f21cdb6b43ecb4fa5f0e4ec"},"schema_version":"1.0","source":{"id":"1811.01237","kind":"arxiv","version":1}},"canonical_sha256":"8c7d03c9042c07877fc2e58af78324f3b232f07afb652328ff584067887d5b26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c7d03c9042c07877fc2e58af78324f3b232f07afb652328ff584067887d5b26","first_computed_at":"2026-05-18T00:01:34.876201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:34.876201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KZ0hD3IzO7V/18OPPwEbPvIzhrpAIveq/YPN+JxFNvO5dqe5ZsTcKlJWXCC+IPOkLUccEvxIDf4+Zh1o/3vfAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:34.877038Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01237","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8e1e0069f6fb11aefefc1dad57c739d8378fea99d77f7b6b4961c0f8cc22674","sha256:932be2049b70f941b0ea377db68c3740a32cc204990776d391247582c193df11"],"state_sha256":"31ffe562760b75b1c68c005595c8bab9278415fd899c55a6d9e83e9eac5012c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HTzovsSDJIytQt+ontpSecEIrKP56VGjpOTuZZ/VgEWwBHf3ajz7z2lLbP8B+3Uv724yF4uY2GO+SbgCH3WbAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:00:25.634071Z","bundle_sha256":"08d6a91aa92c2e3a94438105260fb8c2c04bd2b206f4adb98031adb0e4717383"}}