{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RI32IZGRFK765EI3KBFLLXAWIL","short_pith_number":"pith:RI32IZGR","schema_version":"1.0","canonical_sha256":"8a37a464d12abfee911b504ab5dc1642f3f4f9ad9a9743bcb76f3a131e33ff15","source":{"kind":"arxiv","id":"2211.10738","version":4},"attestation_state":"computed","paper":{"title":"Knowledge Graph Contrastive Learning Based on Relation-Symmetrical Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.AI","authors_text":"Ke Liang, Sihang Zhou, Wenxuan Tu, Xiangjun Dong, Xihong Yang, Xinwang Liu, Yi Wen, Yue Liu","submitted_at":"2022-11-19T16:30:29Z","abstract_excerpt":"Knowledge graph embedding (KGE) aims at learning powerful representations to benefit various artificial intelligence applications. Meanwhile, contrastive learning has been widely leveraged in graph learning as an effective mechanism to enhance the discriminative capacity of the learned representations. However, the complex structures of KG make it hard to construct appropriate contrastive pairs. Only a few attempts have integrated contrastive learning strategies with KGE. But, most of them rely on language models ( e.g., Bert) for contrastive pair construction instead of fully mining informati"},"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":"2211.10738","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-11-19T16:30:29Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"d5e25f5a7f36ac8f63de17ea5e664db9f461dfe87c22baed65d5fb550677d139","abstract_canon_sha256":"cf86b70a1e43faa1115d291414c85c5d4ba3179db29224bef4675b0fe8e154ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:19:54.077150Z","signature_b64":"aMO7F9rbK5smD6O689p/96ZXPQoq1VkIjKHxD/fjm6OZpSX1dpLMQCjQrhEFIShsx3ftmcGr/w1k+trjF30LCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a37a464d12abfee911b504ab5dc1642f3f4f9ad9a9743bcb76f3a131e33ff15","last_reissued_at":"2026-07-05T06:19:54.076757Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:19:54.076757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Knowledge Graph Contrastive Learning Based on Relation-Symmetrical Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.AI","authors_text":"Ke Liang, Sihang Zhou, Wenxuan Tu, Xiangjun Dong, Xihong Yang, Xinwang Liu, Yi Wen, Yue Liu","submitted_at":"2022-11-19T16:30:29Z","abstract_excerpt":"Knowledge graph embedding (KGE) aims at learning powerful representations to benefit various artificial intelligence applications. Meanwhile, contrastive learning has been widely leveraged in graph learning as an effective mechanism to enhance the discriminative capacity of the learned representations. However, the complex structures of KG make it hard to construct appropriate contrastive pairs. Only a few attempts have integrated contrastive learning strategies with KGE. But, most of them rely on language models ( e.g., Bert) for contrastive pair construction instead of fully mining informati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.10738","kind":"arxiv","version":4},"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/2211.10738/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":"2211.10738","created_at":"2026-07-05T06:19:54.076815+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.10738v4","created_at":"2026-07-05T06:19:54.076815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10738","created_at":"2026-07-05T06:19:54.076815+00:00"},{"alias_kind":"pith_short_12","alias_value":"RI32IZGRFK76","created_at":"2026-07-05T06:19:54.076815+00:00"},{"alias_kind":"pith_short_16","alias_value":"RI32IZGRFK765EI3","created_at":"2026-07-05T06:19:54.076815+00:00"},{"alias_kind":"pith_short_8","alias_value":"RI32IZGR","created_at":"2026-07-05T06:19:54.076815+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/RI32IZGRFK765EI3KBFLLXAWIL","json":"https://pith.science/pith/RI32IZGRFK765EI3KBFLLXAWIL.json","graph_json":"https://pith.science/api/pith-number/RI32IZGRFK765EI3KBFLLXAWIL/graph.json","events_json":"https://pith.science/api/pith-number/RI32IZGRFK765EI3KBFLLXAWIL/events.json","paper":"https://pith.science/paper/RI32IZGR"},"agent_actions":{"view_html":"https://pith.science/pith/RI32IZGRFK765EI3KBFLLXAWIL","download_json":"https://pith.science/pith/RI32IZGRFK765EI3KBFLLXAWIL.json","view_paper":"https://pith.science/paper/RI32IZGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.10738&json=true","fetch_graph":"https://pith.science/api/pith-number/RI32IZGRFK765EI3KBFLLXAWIL/graph.json","fetch_events":"https://pith.science/api/pith-number/RI32IZGRFK765EI3KBFLLXAWIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RI32IZGRFK765EI3KBFLLXAWIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RI32IZGRFK765EI3KBFLLXAWIL/action/storage_attestation","attest_author":"https://pith.science/pith/RI32IZGRFK765EI3KBFLLXAWIL/action/author_attestation","sign_citation":"https://pith.science/pith/RI32IZGRFK765EI3KBFLLXAWIL/action/citation_signature","submit_replication":"https://pith.science/pith/RI32IZGRFK765EI3KBFLLXAWIL/action/replication_record"}},"created_at":"2026-07-05T06:19:54.076815+00:00","updated_at":"2026-07-05T06:19:54.076815+00:00"}