{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LWNPVT6HD2EMQA6PWJ74L224SU","short_pith_number":"pith:LWNPVT6H","schema_version":"1.0","canonical_sha256":"5d9afacfc71e88c803cfb27fc5eb5c952c1c00741bc2fa11226d3493f5457ca3","source":{"kind":"arxiv","id":"1903.01306","version":1},"attestation_state":"computed","paper":{"title":"Long-tail Relation Extraction via Knowledge Graph Embeddings and Graph Convolution Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.DB","cs.LG"],"primary_cat":"cs.IR","authors_text":"Guanying Wang, Huajun Chen, Ningyu Zhang, Shumin Deng, Wei Zhang, Xi Chen, Zhanlin Sun","submitted_at":"2019-03-04T15:32:39Z","abstract_excerpt":"We propose a distance supervised relation extraction approach for long-tailed, imbalanced data which is prevalent in real-world settings. Here, the challenge is to learn accurate \"few-shot\" models for classes existing at the tail of the class distribution, for which little data is available. Inspired by the rich semantic correlations between classes at the long tail and those at the head, we take advantage of the knowledge from data-rich classes at the head of the distribution to boost the performance of the data-poor classes at the tail. First, we propose to leverage implicit relational knowl"},"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":"1903.01306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-04T15:32:39Z","cross_cats_sorted":["cs.AI","cs.CL","cs.DB","cs.LG"],"title_canon_sha256":"8426604f7bedf1bef7d16d5855ee40c033347567ec53670e8271b821da70c050","abstract_canon_sha256":"789eb3de2bdc749a2f85a086223ca1b546e05479c758f7bad8558d848a3f47aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:35:40.074422Z","signature_b64":"rT4XMN8RMAXzI3hqM52bZytfX+ViCB4RcN902xVbVNVSzIpzktOXl833t5HwgrpZZaziK78lmcq6r/amfd9mAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d9afacfc71e88c803cfb27fc5eb5c952c1c00741bc2fa11226d3493f5457ca3","last_reissued_at":"2026-07-05T05:35:40.073994Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:35:40.073994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long-tail Relation Extraction via Knowledge Graph Embeddings and Graph Convolution Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.DB","cs.LG"],"primary_cat":"cs.IR","authors_text":"Guanying Wang, Huajun Chen, Ningyu Zhang, Shumin Deng, Wei Zhang, Xi Chen, Zhanlin Sun","submitted_at":"2019-03-04T15:32:39Z","abstract_excerpt":"We propose a distance supervised relation extraction approach for long-tailed, imbalanced data which is prevalent in real-world settings. Here, the challenge is to learn accurate \"few-shot\" models for classes existing at the tail of the class distribution, for which little data is available. Inspired by the rich semantic correlations between classes at the long tail and those at the head, we take advantage of the knowledge from data-rich classes at the head of the distribution to boost the performance of the data-poor classes at the tail. First, we propose to leverage implicit relational knowl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01306","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1903.01306/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1903.01306","created_at":"2026-07-05T05:35:40.074053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01306v1","created_at":"2026-07-05T05:35:40.074053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01306","created_at":"2026-07-05T05:35:40.074053+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWNPVT6HD2EM","created_at":"2026-07-05T05:35:40.074053+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWNPVT6HD2EMQA6P","created_at":"2026-07-05T05:35:40.074053+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWNPVT6H","created_at":"2026-07-05T05:35:40.074053+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.04493","citing_title":"Context-aware Deep Model for Entity Recommendation in Search Engine at Alibaba","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LWNPVT6HD2EMQA6PWJ74L224SU","json":"https://pith.science/pith/LWNPVT6HD2EMQA6PWJ74L224SU.json","graph_json":"https://pith.science/api/pith-number/LWNPVT6HD2EMQA6PWJ74L224SU/graph.json","events_json":"https://pith.science/api/pith-number/LWNPVT6HD2EMQA6PWJ74L224SU/events.json","paper":"https://pith.science/paper/LWNPVT6H"},"agent_actions":{"view_html":"https://pith.science/pith/LWNPVT6HD2EMQA6PWJ74L224SU","download_json":"https://pith.science/pith/LWNPVT6HD2EMQA6PWJ74L224SU.json","view_paper":"https://pith.science/paper/LWNPVT6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01306&json=true","fetch_graph":"https://pith.science/api/pith-number/LWNPVT6HD2EMQA6PWJ74L224SU/graph.json","fetch_events":"https://pith.science/api/pith-number/LWNPVT6HD2EMQA6PWJ74L224SU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWNPVT6HD2EMQA6PWJ74L224SU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWNPVT6HD2EMQA6PWJ74L224SU/action/storage_attestation","attest_author":"https://pith.science/pith/LWNPVT6HD2EMQA6PWJ74L224SU/action/author_attestation","sign_citation":"https://pith.science/pith/LWNPVT6HD2EMQA6PWJ74L224SU/action/citation_signature","submit_replication":"https://pith.science/pith/LWNPVT6HD2EMQA6PWJ74L224SU/action/replication_record"}},"created_at":"2026-07-05T05:35:40.074053+00:00","updated_at":"2026-07-05T05:35:40.074053+00:00"}