{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:X5WYM2M7CW3YMLMBA4WHMCONL2","short_pith_number":"pith:X5WYM2M7","canonical_record":{"source":{"id":"1603.06076","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-03-19T10:09:53Z","cross_cats_sorted":[],"title_canon_sha256":"e5d639bf457d02be71f2660fbf3b175a9121e7149f5177f40535d9c893ebbb5e","abstract_canon_sha256":"e3fe95ceed820606c6c5e8e0e412c6755ea13e140af8534ea37ba9247575f1cf"},"schema_version":"1.0"},"canonical_sha256":"bf6d86699f15b7862d81072c7609cd5eb27a58c3464e6ba8e2399d7ee1092dcd","source":{"kind":"arxiv","id":"1603.06076","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06076","created_at":"2026-05-18T01:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06076v3","created_at":"2026-05-18T01:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06076","created_at":"2026-05-18T01:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"X5WYM2M7CW3Y","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X5WYM2M7CW3YMLMB","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X5WYM2M7","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:X5WYM2M7CW3YMLMBA4WHMCONL2","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06076","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-03-19T10:09:53Z","cross_cats_sorted":[],"title_canon_sha256":"e5d639bf457d02be71f2660fbf3b175a9121e7149f5177f40535d9c893ebbb5e","abstract_canon_sha256":"e3fe95ceed820606c6c5e8e0e412c6755ea13e140af8534ea37ba9247575f1cf"},"schema_version":"1.0"},"canonical_sha256":"bf6d86699f15b7862d81072c7609cd5eb27a58c3464e6ba8e2399d7ee1092dcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:48.696451Z","signature_b64":"DFnPahpA5uAoj2K0QfoWp+B8LqO079ZdvYzczoNAiFo2TtS1K2HX9eJJhbqui3LdzA+fmL//gobDsj3uWc5QCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf6d86699f15b7862d81072c7609cd5eb27a58c3464e6ba8e2399d7ee1092dcd","last_reissued_at":"2026-05-18T01:12:48.696101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:48.696101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06076","source_version":3,"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-18T01:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MEb5uX7c3JKIJTSlGFEwqI0Ow+J3XB1ztwu3g+UzoMvZZDURpU3TzJhWExLn8F4WPtsDfVFsQK90EscM4PEAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:18:25.826769Z"},"content_sha256":"9693ea4099a26c89e397f8a10360c3fba9617276dc04dc23498139759caea45f","schema_version":"1.0","event_id":"sha256:9693ea4099a26c89e397f8a10360c3fba9617276dc04dc23498139759caea45f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:X5WYM2M7CW3YMLMBA4WHMCONL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Hypernymy Detection with an Integrated Path-based and Distributional Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ido Dagan, Vered Shwartz, Yoav Goldberg","submitted_at":"2016-03-19T10:09:53Z","abstract_excerpt":"Detecting hypernymy relations is a key task in NLP, which is addressed in the literature using two complementary approaches. Distributional methods, whose supervised variants are the current best performers, and path-based methods, which received less research attention. We suggest an improved path-based algorithm, in which the dependency paths are encoded using a recurrent neural network, that achieves results comparable to distributional methods. We then extend the approach to integrate both path-based and distributional signals, significantly improving upon the state-of-the-art on this task"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06076","kind":"arxiv","version":3},"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-18T01:12:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TDleP32CEjtuoTwWzemnBKYe88yGS5hbiYtEQ2woWpHWji8FQqNkCFMsKUueTPznM4K0p8N7WODkTImTqpVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:18:25.827393Z"},"content_sha256":"8e214580111a8a0eb9ee825bddb5d56ce1125e73a34d71208913830a2cf3aecc","schema_version":"1.0","event_id":"sha256:8e214580111a8a0eb9ee825bddb5d56ce1125e73a34d71208913830a2cf3aecc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5WYM2M7CW3YMLMBA4WHMCONL2/bundle.json","state_url":"https://pith.science/pith/X5WYM2M7CW3YMLMBA4WHMCONL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5WYM2M7CW3YMLMBA4WHMCONL2/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-30T02:18:25Z","links":{"resolver":"https://pith.science/pith/X5WYM2M7CW3YMLMBA4WHMCONL2","bundle":"https://pith.science/pith/X5WYM2M7CW3YMLMBA4WHMCONL2/bundle.json","state":"https://pith.science/pith/X5WYM2M7CW3YMLMBA4WHMCONL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5WYM2M7CW3YMLMBA4WHMCONL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:X5WYM2M7CW3YMLMBA4WHMCONL2","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":"e3fe95ceed820606c6c5e8e0e412c6755ea13e140af8534ea37ba9247575f1cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-03-19T10:09:53Z","title_canon_sha256":"e5d639bf457d02be71f2660fbf3b175a9121e7149f5177f40535d9c893ebbb5e"},"schema_version":"1.0","source":{"id":"1603.06076","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06076","created_at":"2026-05-18T01:12:48Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06076v3","created_at":"2026-05-18T01:12:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06076","created_at":"2026-05-18T01:12:48Z"},{"alias_kind":"pith_short_12","alias_value":"X5WYM2M7CW3Y","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X5WYM2M7CW3YMLMB","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X5WYM2M7","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:8e214580111a8a0eb9ee825bddb5d56ce1125e73a34d71208913830a2cf3aecc","target":"graph","created_at":"2026-05-18T01:12:48Z","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":"Detecting hypernymy relations is a key task in NLP, which is addressed in the literature using two complementary approaches. Distributional methods, whose supervised variants are the current best performers, and path-based methods, which received less research attention. We suggest an improved path-based algorithm, in which the dependency paths are encoded using a recurrent neural network, that achieves results comparable to distributional methods. We then extend the approach to integrate both path-based and distributional signals, significantly improving upon the state-of-the-art on this task","authors_text":"Ido Dagan, Vered Shwartz, Yoav Goldberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-03-19T10:09:53Z","title":"Improving Hypernymy Detection with an Integrated Path-based and Distributional Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06076","kind":"arxiv","version":3},"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:9693ea4099a26c89e397f8a10360c3fba9617276dc04dc23498139759caea45f","target":"record","created_at":"2026-05-18T01:12:48Z","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":"e3fe95ceed820606c6c5e8e0e412c6755ea13e140af8534ea37ba9247575f1cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-03-19T10:09:53Z","title_canon_sha256":"e5d639bf457d02be71f2660fbf3b175a9121e7149f5177f40535d9c893ebbb5e"},"schema_version":"1.0","source":{"id":"1603.06076","kind":"arxiv","version":3}},"canonical_sha256":"bf6d86699f15b7862d81072c7609cd5eb27a58c3464e6ba8e2399d7ee1092dcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf6d86699f15b7862d81072c7609cd5eb27a58c3464e6ba8e2399d7ee1092dcd","first_computed_at":"2026-05-18T01:12:48.696101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:48.696101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DFnPahpA5uAoj2K0QfoWp+B8LqO079ZdvYzczoNAiFo2TtS1K2HX9eJJhbqui3LdzA+fmL//gobDsj3uWc5QCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:48.696451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06076","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9693ea4099a26c89e397f8a10360c3fba9617276dc04dc23498139759caea45f","sha256:8e214580111a8a0eb9ee825bddb5d56ce1125e73a34d71208913830a2cf3aecc"],"state_sha256":"03fec260d965f367d875a4ec4abee30dc574cd6a71c0eb15e33a9e43f970de24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KsxopU0tNZ1+r/3RbbfpCo3uFCn2F9E+f57CYVyaQEbQIlzE8iK7kNq9JklXfAdOehZdY0U6c+TUKPGAiPc4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:18:25.832122Z","bundle_sha256":"9afec5572aa664b14183717058a837756ccc228b46e81bc0651add61737bbbc8"}}