{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WKUBCGVH2I5N2GJDQY7CRCDANT","short_pith_number":"pith:WKUBCGVH","schema_version":"1.0","canonical_sha256":"b2a8111aa7d23add1923863e2888606cc3f7de17b63864cbffe0f4cc6773e179","source":{"kind":"arxiv","id":"2203.04703","version":3},"attestation_state":"computed","paper":{"title":"LEMON: LanguagE ModeL for Negative Sampling of Knowledge Graph Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Jens Lehmann, Md Rashad Al Hasan Rony, Mirza Mohtashim Alam, Sahar Vahdati, Semab Ali","submitted_at":"2022-03-09T13:27:47Z","abstract_excerpt":"Knowledge Graph Embedding models have become an important area of machine learning.Those models provide a latent representation of entities and relations in a knowledge graph which can then be used in downstream machine learning tasks such as link prediction. The learning process of such models can be performed by contrasting positive and negative triples. While all triples of a KG are considered positive, negative triples are usually not readily available. Therefore, the choice of the sampling method to obtain the negative triples play a crucial role in the performance and effectiveness of Kn"},"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":"2203.04703","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-03-09T13:27:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c13a2d17a5295c7bc196eb89f78a51c8fa65b85a41df3df484e3a533a2f177df","abstract_canon_sha256":"2c1d70a610c27d6b6e5bab4bec067b3fc579fb0a6d837ced01c87bf7547fb5e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:55.722018Z","signature_b64":"IwHKpB8vLHU0tk/45XYOg/UMbQVIik1wvKZVSg4vIAQd2foJUZKQc2N/gVm4ze7FJFp1orMELM/w216mS3EaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2a8111aa7d23add1923863e2888606cc3f7de17b63864cbffe0f4cc6773e179","last_reissued_at":"2026-07-05T05:06:55.721559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:55.721559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LEMON: LanguagE ModeL for Negative Sampling of Knowledge Graph Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Jens Lehmann, Md Rashad Al Hasan Rony, Mirza Mohtashim Alam, Sahar Vahdati, Semab Ali","submitted_at":"2022-03-09T13:27:47Z","abstract_excerpt":"Knowledge Graph Embedding models have become an important area of machine learning.Those models provide a latent representation of entities and relations in a knowledge graph which can then be used in downstream machine learning tasks such as link prediction. The learning process of such models can be performed by contrasting positive and negative triples. While all triples of a KG are considered positive, negative triples are usually not readily available. Therefore, the choice of the sampling method to obtain the negative triples play a crucial role in the performance and effectiveness of Kn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.04703","kind":"arxiv","version":3},"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/2203.04703/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":"2203.04703","created_at":"2026-07-05T05:06:55.721614+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.04703v3","created_at":"2026-07-05T05:06:55.721614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.04703","created_at":"2026-07-05T05:06:55.721614+00:00"},{"alias_kind":"pith_short_12","alias_value":"WKUBCGVH2I5N","created_at":"2026-07-05T05:06:55.721614+00:00"},{"alias_kind":"pith_short_16","alias_value":"WKUBCGVH2I5N2GJD","created_at":"2026-07-05T05:06:55.721614+00:00"},{"alias_kind":"pith_short_8","alias_value":"WKUBCGVH","created_at":"2026-07-05T05:06:55.721614+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.14858","citing_title":"Domain and Range Aware Synthetic Negatives Generation for Knowledge Graph Embedding Models","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WKUBCGVH2I5N2GJDQY7CRCDANT","json":"https://pith.science/pith/WKUBCGVH2I5N2GJDQY7CRCDANT.json","graph_json":"https://pith.science/api/pith-number/WKUBCGVH2I5N2GJDQY7CRCDANT/graph.json","events_json":"https://pith.science/api/pith-number/WKUBCGVH2I5N2GJDQY7CRCDANT/events.json","paper":"https://pith.science/paper/WKUBCGVH"},"agent_actions":{"view_html":"https://pith.science/pith/WKUBCGVH2I5N2GJDQY7CRCDANT","download_json":"https://pith.science/pith/WKUBCGVH2I5N2GJDQY7CRCDANT.json","view_paper":"https://pith.science/paper/WKUBCGVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.04703&json=true","fetch_graph":"https://pith.science/api/pith-number/WKUBCGVH2I5N2GJDQY7CRCDANT/graph.json","fetch_events":"https://pith.science/api/pith-number/WKUBCGVH2I5N2GJDQY7CRCDANT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WKUBCGVH2I5N2GJDQY7CRCDANT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WKUBCGVH2I5N2GJDQY7CRCDANT/action/storage_attestation","attest_author":"https://pith.science/pith/WKUBCGVH2I5N2GJDQY7CRCDANT/action/author_attestation","sign_citation":"https://pith.science/pith/WKUBCGVH2I5N2GJDQY7CRCDANT/action/citation_signature","submit_replication":"https://pith.science/pith/WKUBCGVH2I5N2GJDQY7CRCDANT/action/replication_record"}},"created_at":"2026-07-05T05:06:55.721614+00:00","updated_at":"2026-07-05T05:06:55.721614+00:00"}