{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VIWDLJJUDJ37YWOFZV7H4MFMTR","short_pith_number":"pith:VIWDLJJU","schema_version":"1.0","canonical_sha256":"aa2c35a5341a77fc59c5cd7e7e30ac9c72546fcaa39b8dbbaf39cbc69fa0588b","source":{"kind":"arxiv","id":"2111.00658","version":2},"attestation_state":"computed","paper":{"title":"RMNA: A Neighbor Aggregation-Based Knowledge Graph Representation Learning Model Using Rule Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chaodu Song, Jun Cui, Ling Chen, Xing Tang, Yansheng Li, Yongjun Zhang, Yuntao Qian","submitted_at":"2021-11-01T02:08:26Z","abstract_excerpt":"Although the state-of-the-art traditional representation learning (TRL) models show competitive performance on knowledge graph completion, there is no parameter sharing between the embeddings of entities, and the connections between entities are weak. Therefore, neighbor aggregation-based representation learning (NARL) models are proposed, which encode the information in the neighbors of an entity into its embeddings. However, existing NARL models either only utilize one-hop neighbors, ignoring the information in multi-hop neighbors, or utilize multi-hop neighbors by hierarchical neighbor aggr"},"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":"2111.00658","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-01T02:08:26Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"de93bcc76344602a5129b320fc04a9c2a5fd1ee6348d49153aff77dd84474203","abstract_canon_sha256":"ec2d4a2700cd64335a49e392c5e71c9696f3bceda5948e49c53f4e624a856273"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:29:04.584455Z","signature_b64":"FvZurHAMnSuiunaAMxoM4FpqvOXpN/gnQuGsvyPjUqZ/dErPOZyVarJByr/KagwHR6XriCa6Z7TmKD90Vyk3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa2c35a5341a77fc59c5cd7e7e30ac9c72546fcaa39b8dbbaf39cbc69fa0588b","last_reissued_at":"2026-07-05T03:29:04.584000Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:29:04.584000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RMNA: A Neighbor Aggregation-Based Knowledge Graph Representation Learning Model Using Rule Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chaodu Song, Jun Cui, Ling Chen, Xing Tang, Yansheng Li, Yongjun Zhang, Yuntao Qian","submitted_at":"2021-11-01T02:08:26Z","abstract_excerpt":"Although the state-of-the-art traditional representation learning (TRL) models show competitive performance on knowledge graph completion, there is no parameter sharing between the embeddings of entities, and the connections between entities are weak. Therefore, neighbor aggregation-based representation learning (NARL) models are proposed, which encode the information in the neighbors of an entity into its embeddings. However, existing NARL models either only utilize one-hop neighbors, ignoring the information in multi-hop neighbors, or utilize multi-hop neighbors by hierarchical neighbor aggr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00658","kind":"arxiv","version":2},"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/2111.00658/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":"2111.00658","created_at":"2026-07-05T03:29:04.584058+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.00658v2","created_at":"2026-07-05T03:29:04.584058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00658","created_at":"2026-07-05T03:29:04.584058+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIWDLJJUDJ37","created_at":"2026-07-05T03:29:04.584058+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIWDLJJUDJ37YWOF","created_at":"2026-07-05T03:29:04.584058+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIWDLJJU","created_at":"2026-07-05T03:29:04.584058+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/VIWDLJJUDJ37YWOFZV7H4MFMTR","json":"https://pith.science/pith/VIWDLJJUDJ37YWOFZV7H4MFMTR.json","graph_json":"https://pith.science/api/pith-number/VIWDLJJUDJ37YWOFZV7H4MFMTR/graph.json","events_json":"https://pith.science/api/pith-number/VIWDLJJUDJ37YWOFZV7H4MFMTR/events.json","paper":"https://pith.science/paper/VIWDLJJU"},"agent_actions":{"view_html":"https://pith.science/pith/VIWDLJJUDJ37YWOFZV7H4MFMTR","download_json":"https://pith.science/pith/VIWDLJJUDJ37YWOFZV7H4MFMTR.json","view_paper":"https://pith.science/paper/VIWDLJJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.00658&json=true","fetch_graph":"https://pith.science/api/pith-number/VIWDLJJUDJ37YWOFZV7H4MFMTR/graph.json","fetch_events":"https://pith.science/api/pith-number/VIWDLJJUDJ37YWOFZV7H4MFMTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIWDLJJUDJ37YWOFZV7H4MFMTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIWDLJJUDJ37YWOFZV7H4MFMTR/action/storage_attestation","attest_author":"https://pith.science/pith/VIWDLJJUDJ37YWOFZV7H4MFMTR/action/author_attestation","sign_citation":"https://pith.science/pith/VIWDLJJUDJ37YWOFZV7H4MFMTR/action/citation_signature","submit_replication":"https://pith.science/pith/VIWDLJJUDJ37YWOFZV7H4MFMTR/action/replication_record"}},"created_at":"2026-07-05T03:29:04.584058+00:00","updated_at":"2026-07-05T03:29:04.584058+00:00"}