{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZNCE7BD6LMD75WH6PIGWGJNT52","short_pith_number":"pith:ZNCE7BD6","schema_version":"1.0","canonical_sha256":"cb444f847e5b07fed8fe7a0d6325b3ee9ccc9f9151d481b4229027e1555cfe8e","source":{"kind":"arxiv","id":"2102.07200","version":1},"attestation_state":"computed","paper":{"title":"Knowledge Graph Embedding using Graph Convolutional Networks with Relation-Aware Attention","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Berthold Reinwald, Christoph Miksovic, Nasrullah Sheikh, Paolo Scotton, Thomas Gschwind, Xiao Qin","submitted_at":"2021-02-14T17:19:44Z","abstract_excerpt":"Knowledge graph embedding methods learn embeddings of entities and relations in a low dimensional space which can be used for various downstream machine learning tasks such as link prediction and entity matching. Various graph convolutional network methods have been proposed which use different types of information to learn the features of entities and relations. However, these methods assign the same weight (importance) to the neighbors when aggregating the information, ignoring the role of different relations with the neighboring entities. To this end, we propose a relation-aware graph atten"},"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":"2102.07200","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-14T17:19:44Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"da969a2c7d3d2a41003e3509fe3ed6d1d4f2c1f88c40c994d385fe3a2f1513ba","abstract_canon_sha256":"a32aef139a2817c7aa837f06f6fc5e00c7828bbd1f36827135d7ff5f72d314ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:15:02.515480Z","signature_b64":"DTorUK85y9vYHxiIgiGkOMTx5n418oQUiJaTrLUqoeMJrW56ZJQSCCP3MsA8yh7U2oRWoR3NlEb0p6tVnaV8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb444f847e5b07fed8fe7a0d6325b3ee9ccc9f9151d481b4229027e1555cfe8e","last_reissued_at":"2026-07-05T02:15:02.514954Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:15:02.514954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Knowledge Graph Embedding using Graph Convolutional Networks with Relation-Aware Attention","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Berthold Reinwald, Christoph Miksovic, Nasrullah Sheikh, Paolo Scotton, Thomas Gschwind, Xiao Qin","submitted_at":"2021-02-14T17:19:44Z","abstract_excerpt":"Knowledge graph embedding methods learn embeddings of entities and relations in a low dimensional space which can be used for various downstream machine learning tasks such as link prediction and entity matching. Various graph convolutional network methods have been proposed which use different types of information to learn the features of entities and relations. However, these methods assign the same weight (importance) to the neighbors when aggregating the information, ignoring the role of different relations with the neighboring entities. To this end, we propose a relation-aware graph atten"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.07200","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/2102.07200/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":"2102.07200","created_at":"2026-07-05T02:15:02.515016+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.07200v1","created_at":"2026-07-05T02:15:02.515016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.07200","created_at":"2026-07-05T02:15:02.515016+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNCE7BD6LMD7","created_at":"2026-07-05T02:15:02.515016+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNCE7BD6LMD75WH6","created_at":"2026-07-05T02:15:02.515016+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNCE7BD6","created_at":"2026-07-05T02:15:02.515016+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10317","citing_title":"Relations Are Channels: Knowledge Graph Embedding via Kraus Decompositions","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZNCE7BD6LMD75WH6PIGWGJNT52","json":"https://pith.science/pith/ZNCE7BD6LMD75WH6PIGWGJNT52.json","graph_json":"https://pith.science/api/pith-number/ZNCE7BD6LMD75WH6PIGWGJNT52/graph.json","events_json":"https://pith.science/api/pith-number/ZNCE7BD6LMD75WH6PIGWGJNT52/events.json","paper":"https://pith.science/paper/ZNCE7BD6"},"agent_actions":{"view_html":"https://pith.science/pith/ZNCE7BD6LMD75WH6PIGWGJNT52","download_json":"https://pith.science/pith/ZNCE7BD6LMD75WH6PIGWGJNT52.json","view_paper":"https://pith.science/paper/ZNCE7BD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.07200&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNCE7BD6LMD75WH6PIGWGJNT52/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNCE7BD6LMD75WH6PIGWGJNT52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNCE7BD6LMD75WH6PIGWGJNT52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNCE7BD6LMD75WH6PIGWGJNT52/action/storage_attestation","attest_author":"https://pith.science/pith/ZNCE7BD6LMD75WH6PIGWGJNT52/action/author_attestation","sign_citation":"https://pith.science/pith/ZNCE7BD6LMD75WH6PIGWGJNT52/action/citation_signature","submit_replication":"https://pith.science/pith/ZNCE7BD6LMD75WH6PIGWGJNT52/action/replication_record"}},"created_at":"2026-07-05T02:15:02.515016+00:00","updated_at":"2026-07-05T02:15:02.515016+00:00"}