{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UK6WJLHR3NKZZMHMGBAXEICSBL","short_pith_number":"pith:UK6WJLHR","schema_version":"1.0","canonical_sha256":"a2bd64acf1db559cb0ec30417220520af3742b5ae7bd0314c461c029e0628693","source":{"kind":"arxiv","id":"1908.11513","version":1},"attestation_state":"computed","paper":{"title":"Adapting Meta Knowledge Graph Information for Multi-Hop Reasoning over Few-Shot Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Juanzi Li, Lei Hou, Xin Lv, Xu Han, Yuxian Gu, Zhiyuan Liu","submitted_at":"2019-08-30T02:44:44Z","abstract_excerpt":"Multi-hop knowledge graph (KG) reasoning is an effective and explainable method for predicting the target entity via reasoning paths in query answering (QA) task. Most previous methods assume that every relation in KGs has enough training triples, regardless of those few-shot relations which cannot provide sufficient triples for training robust reasoning models. In fact, the performance of existing multi-hop reasoning methods drops significantly on few-shot relations. In this paper, we propose a meta-based multi-hop reasoning method (Meta-KGR), which adopts meta-learning to learn effective met"},"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":"1908.11513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-08-30T02:44:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"145f75901a86a1c7ddd843a5f775aa6e10fe5d63edfeaf94edd3490c4c83c075","abstract_canon_sha256":"580fe787054845e35a8ff37a651bfd7812976fd53ff03c7eef365bce09a293eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:37.284151Z","signature_b64":"d/lFWM4jK6pdo9Ua/YI4/SBjGOA+R+05UwocwSQS9YIll6vEtYZ+4GzsWSkBLfrZwdSArSEG8IBEdlj5JUelCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2bd64acf1db559cb0ec30417220520af3742b5ae7bd0314c461c029e0628693","last_reissued_at":"2026-07-05T00:00:37.283815Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:37.283815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adapting Meta Knowledge Graph Information for Multi-Hop Reasoning over Few-Shot Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Juanzi Li, Lei Hou, Xin Lv, Xu Han, Yuxian Gu, Zhiyuan Liu","submitted_at":"2019-08-30T02:44:44Z","abstract_excerpt":"Multi-hop knowledge graph (KG) reasoning is an effective and explainable method for predicting the target entity via reasoning paths in query answering (QA) task. Most previous methods assume that every relation in KGs has enough training triples, regardless of those few-shot relations which cannot provide sufficient triples for training robust reasoning models. In fact, the performance of existing multi-hop reasoning methods drops significantly on few-shot relations. In this paper, we propose a meta-based multi-hop reasoning method (Meta-KGR), which adopts meta-learning to learn effective met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.11513","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/1908.11513/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":"1908.11513","created_at":"2026-07-05T00:00:37.283871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.11513v1","created_at":"2026-07-05T00:00:37.283871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.11513","created_at":"2026-07-05T00:00:37.283871+00:00"},{"alias_kind":"pith_short_12","alias_value":"UK6WJLHR3NKZ","created_at":"2026-07-05T00:00:37.283871+00:00"},{"alias_kind":"pith_short_16","alias_value":"UK6WJLHR3NKZZMHM","created_at":"2026-07-05T00:00:37.283871+00:00"},{"alias_kind":"pith_short_8","alias_value":"UK6WJLHR","created_at":"2026-07-05T00:00:37.283871+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/UK6WJLHR3NKZZMHMGBAXEICSBL","json":"https://pith.science/pith/UK6WJLHR3NKZZMHMGBAXEICSBL.json","graph_json":"https://pith.science/api/pith-number/UK6WJLHR3NKZZMHMGBAXEICSBL/graph.json","events_json":"https://pith.science/api/pith-number/UK6WJLHR3NKZZMHMGBAXEICSBL/events.json","paper":"https://pith.science/paper/UK6WJLHR"},"agent_actions":{"view_html":"https://pith.science/pith/UK6WJLHR3NKZZMHMGBAXEICSBL","download_json":"https://pith.science/pith/UK6WJLHR3NKZZMHMGBAXEICSBL.json","view_paper":"https://pith.science/paper/UK6WJLHR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.11513&json=true","fetch_graph":"https://pith.science/api/pith-number/UK6WJLHR3NKZZMHMGBAXEICSBL/graph.json","fetch_events":"https://pith.science/api/pith-number/UK6WJLHR3NKZZMHMGBAXEICSBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UK6WJLHR3NKZZMHMGBAXEICSBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UK6WJLHR3NKZZMHMGBAXEICSBL/action/storage_attestation","attest_author":"https://pith.science/pith/UK6WJLHR3NKZZMHMGBAXEICSBL/action/author_attestation","sign_citation":"https://pith.science/pith/UK6WJLHR3NKZZMHMGBAXEICSBL/action/citation_signature","submit_replication":"https://pith.science/pith/UK6WJLHR3NKZZMHMGBAXEICSBL/action/replication_record"}},"created_at":"2026-07-05T00:00:37.283871+00:00","updated_at":"2026-07-05T00:00:37.283871+00:00"}