{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SEB5BIRLCJIDLPALMPZZ4BCRGS","short_pith_number":"pith:SEB5BIRL","schema_version":"1.0","canonical_sha256":"9103d0a22b125035bc0b63f39e04513495c66cfdc194c370d23c244ae0838fe5","source":{"kind":"arxiv","id":"1909.01515","version":1},"attestation_state":"computed","paper":{"title":"Meta Relational Learning for Few-Shot Link Prediction in Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.CL","authors_text":"Huajun Chen, Mingyang Chen, Qiang Chen, Wei Zhang, Wen Zhang","submitted_at":"2019-09-04T01:35:47Z","abstract_excerpt":"Link prediction is an important way to complete knowledge graphs (KGs), while embedding-based methods, effective for link prediction in KGs, perform poorly on relations that only have a few associative triples. In this work, we propose a Meta Relational Learning (MetaR) framework to do the common but challenging few-shot link prediction in KGs, namely predicting new triples about a relation by only observing a few associative triples. We solve few-shot link prediction by focusing on transferring relation-specific meta information to make model learn the most important knowledge and learn faste"},"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":"1909.01515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-09-04T01:35:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0cb44b0f2eac457af65fc0c632d14b07fb1f5c55a7e1ceef0f4c24bd79b900b1","abstract_canon_sha256":"45f035dcc1d510a3acfb8e8903f43f9423d5cd4e8a3272e31062fa3a03448161"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:17.094027Z","signature_b64":"RRjAoFtmGaRdUPrWDlXQI/2EUaFPXPtn2UPk5xbopltWESx4qgob2xJUbvbNgwbukDEfZC5k7qYUeibDm4yaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9103d0a22b125035bc0b63f39e04513495c66cfdc194c370d23c244ae0838fe5","last_reissued_at":"2026-07-05T00:02:17.093597Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:17.093597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Meta Relational Learning for Few-Shot Link Prediction in Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.CL","authors_text":"Huajun Chen, Mingyang Chen, Qiang Chen, Wei Zhang, Wen Zhang","submitted_at":"2019-09-04T01:35:47Z","abstract_excerpt":"Link prediction is an important way to complete knowledge graphs (KGs), while embedding-based methods, effective for link prediction in KGs, perform poorly on relations that only have a few associative triples. In this work, we propose a Meta Relational Learning (MetaR) framework to do the common but challenging few-shot link prediction in KGs, namely predicting new triples about a relation by only observing a few associative triples. We solve few-shot link prediction by focusing on transferring relation-specific meta information to make model learn the most important knowledge and learn faste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01515","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/1909.01515/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":"1909.01515","created_at":"2026-07-05T00:02:17.093661+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.01515v1","created_at":"2026-07-05T00:02:17.093661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01515","created_at":"2026-07-05T00:02:17.093661+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEB5BIRLCJID","created_at":"2026-07-05T00:02:17.093661+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEB5BIRLCJIDLPAL","created_at":"2026-07-05T00:02:17.093661+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEB5BIRL","created_at":"2026-07-05T00:02:17.093661+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.16433","citing_title":"FrogDogNet: Fourier frequency Retained visual prompt Output Guidance for Domain Generalization of CLIP in Remote Sensing","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SEB5BIRLCJIDLPALMPZZ4BCRGS","json":"https://pith.science/pith/SEB5BIRLCJIDLPALMPZZ4BCRGS.json","graph_json":"https://pith.science/api/pith-number/SEB5BIRLCJIDLPALMPZZ4BCRGS/graph.json","events_json":"https://pith.science/api/pith-number/SEB5BIRLCJIDLPALMPZZ4BCRGS/events.json","paper":"https://pith.science/paper/SEB5BIRL"},"agent_actions":{"view_html":"https://pith.science/pith/SEB5BIRLCJIDLPALMPZZ4BCRGS","download_json":"https://pith.science/pith/SEB5BIRLCJIDLPALMPZZ4BCRGS.json","view_paper":"https://pith.science/paper/SEB5BIRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.01515&json=true","fetch_graph":"https://pith.science/api/pith-number/SEB5BIRLCJIDLPALMPZZ4BCRGS/graph.json","fetch_events":"https://pith.science/api/pith-number/SEB5BIRLCJIDLPALMPZZ4BCRGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEB5BIRLCJIDLPALMPZZ4BCRGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEB5BIRLCJIDLPALMPZZ4BCRGS/action/storage_attestation","attest_author":"https://pith.science/pith/SEB5BIRLCJIDLPALMPZZ4BCRGS/action/author_attestation","sign_citation":"https://pith.science/pith/SEB5BIRLCJIDLPALMPZZ4BCRGS/action/citation_signature","submit_replication":"https://pith.science/pith/SEB5BIRLCJIDLPALMPZZ4BCRGS/action/replication_record"}},"created_at":"2026-07-05T00:02:17.093661+00:00","updated_at":"2026-07-05T00:02:17.093661+00:00"}