{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:X5WYM2M7CW3YMLMBA4WHMCONL2","short_pith_number":"pith:X5WYM2M7","schema_version":"1.0","canonical_sha256":"bf6d86699f15b7862d81072c7609cd5eb27a58c3464e6ba8e2399d7ee1092dcd","source":{"kind":"arxiv","id":"1603.06076","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.06076","created_at":"2026-05-18T01:12:48.696159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06076v3","created_at":"2026-05-18T01:12:48.696159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06076","created_at":"2026-05-18T01:12:48.696159+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5WYM2M7CW3Y","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5WYM2M7CW3YMLMB","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5WYM2M7","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X5WYM2M7CW3YMLMBA4WHMCONL2","json":"https://pith.science/pith/X5WYM2M7CW3YMLMBA4WHMCONL2.json","graph_json":"https://pith.science/api/pith-number/X5WYM2M7CW3YMLMBA4WHMCONL2/graph.json","events_json":"https://pith.science/api/pith-number/X5WYM2M7CW3YMLMBA4WHMCONL2/events.json","paper":"https://pith.science/paper/X5WYM2M7"},"agent_actions":{"view_html":"https://pith.science/pith/X5WYM2M7CW3YMLMBA4WHMCONL2","download_json":"https://pith.science/pith/X5WYM2M7CW3YMLMBA4WHMCONL2.json","view_paper":"https://pith.science/paper/X5WYM2M7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06076&json=true","fetch_graph":"https://pith.science/api/pith-number/X5WYM2M7CW3YMLMBA4WHMCONL2/graph.json","fetch_events":"https://pith.science/api/pith-number/X5WYM2M7CW3YMLMBA4WHMCONL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5WYM2M7CW3YMLMBA4WHMCONL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5WYM2M7CW3YMLMBA4WHMCONL2/action/storage_attestation","attest_author":"https://pith.science/pith/X5WYM2M7CW3YMLMBA4WHMCONL2/action/author_attestation","sign_citation":"https://pith.science/pith/X5WYM2M7CW3YMLMBA4WHMCONL2/action/citation_signature","submit_replication":"https://pith.science/pith/X5WYM2M7CW3YMLMBA4WHMCONL2/action/replication_record"}},"created_at":"2026-05-18T01:12:48.696159+00:00","updated_at":"2026-05-18T01:12:48.696159+00:00"}