{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RFYLSS6MM63LTQ4QT7PYQ2GB5D","short_pith_number":"pith:RFYLSS6M","canonical_record":{"source":{"id":"1805.04044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-10T16:19:14Z","cross_cats_sorted":[],"title_canon_sha256":"c050780fcb1cd62396f2793b4965776efd2679f8e156575e8c34a55c90dd33e6","abstract_canon_sha256":"7cd8ba8620ab5680b1f4e04b97377934e82fc73dcbc17d3f0680c6cd1df5d3d3"},"schema_version":"1.0"},"canonical_sha256":"8970b94bcc67b6b9c3909fdf8868c1e8c5f139684c3906ea86ab4c6092d8b8aa","source":{"kind":"arxiv","id":"1805.04044","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04044","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04044v1","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04044","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"pith_short_12","alias_value":"RFYLSS6MM63L","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RFYLSS6MM63LTQ4Q","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RFYLSS6M","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RFYLSS6MM63LTQ4QT7PYQ2GB5D","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-10T16:19:14Z","cross_cats_sorted":[],"title_canon_sha256":"c050780fcb1cd62396f2793b4965776efd2679f8e156575e8c34a55c90dd33e6","abstract_canon_sha256":"7cd8ba8620ab5680b1f4e04b97377934e82fc73dcbc17d3f0680c6cd1df5d3d3"},"schema_version":"1.0"},"canonical_sha256":"8970b94bcc67b6b9c3909fdf8868c1e8c5f139684c3906ea86ab4c6092d8b8aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:13.598060Z","signature_b64":"IP98skkDWmJ8CJ66HMusObub+USwIJAvISGK4gwNoggwHgYfMH9GgqMLvGVZKfKcaMbPd5CjEuhOlWz9XgTBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8970b94bcc67b6b9c3909fdf8868c1e8c5f139684c3906ea86ab4c6092d8b8aa","last_reissued_at":"2026-05-18T00:16:13.597309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:13.597309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04044","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:16:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjFJaXI950KVZkrxhOi0KalQD0w0y1rV1MnmNC86ep46cPOcj4Mo3kxgGsJQsfM9nOxvI+kUktrZErrqa7BLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T00:53:54.946406Z"},"content_sha256":"349449e9fc161decbf4612bed635d34274a22dd174b8a713360ae16a5794a70a","schema_version":"1.0","event_id":"sha256:349449e9fc161decbf4612bed635d34274a22dd174b8a713360ae16a5794a70a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RFYLSS6MM63LTQ4QT7PYQ2GB5D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"End-to-End Reinforcement Learning for Automatic Taxonomy Induction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jiaming Shen, Jiawei Han, Xiang Ren, Xiaotao Gu, Yuning Mao","submitted_at":"2018-05-10T16:19:14Z","abstract_excerpt":"We present a novel end-to-end reinforcement learning approach to automatic taxonomy induction from a set of terms. While prior methods treat the problem as a two-phase task (i.e., detecting hypernymy pairs followed by organizing these pairs into a tree-structured hierarchy), we argue that such two-phase methods may suffer from error propagation, and cannot effectively optimize metrics that capture the holistic structure of a taxonomy. In our approach, the representations of term pairs are learned using multiple sources of information and used to determine \\textit{which} term to select and \\tex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04044","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:16:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PiL2oQLOcnpncMGqSeA5mL1QZqwd64SnMbXeomgNP8jqdeySzDoqjIUVUTm5vId7PNuu9uWcPcWvZsBOVRJnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T00:53:54.947229Z"},"content_sha256":"bd55ef1d402e0e12228cb4abaca4084f47b725e49aef646367637f90a66bf340","schema_version":"1.0","event_id":"sha256:bd55ef1d402e0e12228cb4abaca4084f47b725e49aef646367637f90a66bf340"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFYLSS6MM63LTQ4QT7PYQ2GB5D/bundle.json","state_url":"https://pith.science/pith/RFYLSS6MM63LTQ4QT7PYQ2GB5D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFYLSS6MM63LTQ4QT7PYQ2GB5D/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-08-03T00:53:54Z","links":{"resolver":"https://pith.science/pith/RFYLSS6MM63LTQ4QT7PYQ2GB5D","bundle":"https://pith.science/pith/RFYLSS6MM63LTQ4QT7PYQ2GB5D/bundle.json","state":"https://pith.science/pith/RFYLSS6MM63LTQ4QT7PYQ2GB5D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFYLSS6MM63LTQ4QT7PYQ2GB5D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RFYLSS6MM63LTQ4QT7PYQ2GB5D","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":"7cd8ba8620ab5680b1f4e04b97377934e82fc73dcbc17d3f0680c6cd1df5d3d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-10T16:19:14Z","title_canon_sha256":"c050780fcb1cd62396f2793b4965776efd2679f8e156575e8c34a55c90dd33e6"},"schema_version":"1.0","source":{"id":"1805.04044","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04044","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04044v1","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04044","created_at":"2026-05-18T00:16:13Z"},{"alias_kind":"pith_short_12","alias_value":"RFYLSS6MM63L","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RFYLSS6MM63LTQ4Q","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RFYLSS6M","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:bd55ef1d402e0e12228cb4abaca4084f47b725e49aef646367637f90a66bf340","target":"graph","created_at":"2026-05-18T00:16:13Z","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":"We present a novel end-to-end reinforcement learning approach to automatic taxonomy induction from a set of terms. While prior methods treat the problem as a two-phase task (i.e., detecting hypernymy pairs followed by organizing these pairs into a tree-structured hierarchy), we argue that such two-phase methods may suffer from error propagation, and cannot effectively optimize metrics that capture the holistic structure of a taxonomy. In our approach, the representations of term pairs are learned using multiple sources of information and used to determine \\textit{which} term to select and \\tex","authors_text":"Jiaming Shen, Jiawei Han, Xiang Ren, Xiaotao Gu, Yuning Mao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-10T16:19:14Z","title":"End-to-End Reinforcement Learning for Automatic Taxonomy Induction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04044","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:349449e9fc161decbf4612bed635d34274a22dd174b8a713360ae16a5794a70a","target":"record","created_at":"2026-05-18T00:16:13Z","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":"7cd8ba8620ab5680b1f4e04b97377934e82fc73dcbc17d3f0680c6cd1df5d3d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-10T16:19:14Z","title_canon_sha256":"c050780fcb1cd62396f2793b4965776efd2679f8e156575e8c34a55c90dd33e6"},"schema_version":"1.0","source":{"id":"1805.04044","kind":"arxiv","version":1}},"canonical_sha256":"8970b94bcc67b6b9c3909fdf8868c1e8c5f139684c3906ea86ab4c6092d8b8aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8970b94bcc67b6b9c3909fdf8868c1e8c5f139684c3906ea86ab4c6092d8b8aa","first_computed_at":"2026-05-18T00:16:13.597309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:13.597309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IP98skkDWmJ8CJ66HMusObub+USwIJAvISGK4gwNoggwHgYfMH9GgqMLvGVZKfKcaMbPd5CjEuhOlWz9XgTBCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:13.598060Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04044","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:349449e9fc161decbf4612bed635d34274a22dd174b8a713360ae16a5794a70a","sha256:bd55ef1d402e0e12228cb4abaca4084f47b725e49aef646367637f90a66bf340"],"state_sha256":"32b8a19bcd17010b7647aade2253ba5ad49cb02a2667b33d0f80edc43bdd1b03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"83rKCwP036p8qWwZF0ubpxydjPR+O3Es6YOTweP46f5SIMdaUF6Nr8nhvoKAKhMGXYvHZdMculFJXw4/GzKeDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T00:53:54.954604Z","bundle_sha256":"66eb7504795e54d9e84624076ded21ca9ea4ff404036c3745a4b3feae3ab9880"}}