{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VUWFHRXJ67BWALOAWA5Y5O3AAW","short_pith_number":"pith:VUWFHRXJ","schema_version":"1.0","canonical_sha256":"ad2c53c6e9f7c3602dc0b03b8ebb6005bd4d993462660bc863115c28ca3f7259","source":{"kind":"arxiv","id":"2207.06014","version":1},"attestation_state":"computed","paper":{"title":"The DLCC Node Classification Benchmark for Analyzing Knowledge Graph Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Heiko Paulheim, Jan Portisch","submitted_at":"2022-07-13T07:43:51Z","abstract_excerpt":"Knowledge graph embedding is a representation learning technique that projects entities and relations in a knowledge graph to continuous vector spaces. Embeddings have gained a lot of uptake and have been heavily used in link prediction and other downstream prediction tasks. Most approaches are evaluated on a single task or a single group of tasks to determine their overall performance. The evaluation is then assessed in terms of how well the embedding approach performs on the task at hand. Still, it is hardly evaluated (and often not even deeply understood) what information the embedding appr"},"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":"2207.06014","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-07-13T07:43:51Z","cross_cats_sorted":[],"title_canon_sha256":"d5f92f41f41c36476ac5a57e9a7ccc5c37ab5766d677be3383ddc9c82bac0dd5","abstract_canon_sha256":"7000a1d7fb9c0f10164a1d09bb0e9025b8af56982232b24fe56b51f0875c587a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:39:53.818192Z","signature_b64":"M9b8qFSlT/MZL+uZY1pq2chh84r3o/nVZv5iMofwLgiyxitp/Taz9wDcyMXd9fxv8c0SqYaIg4R2iTJ+NcRtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad2c53c6e9f7c3602dc0b03b8ebb6005bd4d993462660bc863115c28ca3f7259","last_reissued_at":"2026-07-05T04:39:53.817814Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:39:53.817814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The DLCC Node Classification Benchmark for Analyzing Knowledge Graph Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Heiko Paulheim, Jan Portisch","submitted_at":"2022-07-13T07:43:51Z","abstract_excerpt":"Knowledge graph embedding is a representation learning technique that projects entities and relations in a knowledge graph to continuous vector spaces. Embeddings have gained a lot of uptake and have been heavily used in link prediction and other downstream prediction tasks. Most approaches are evaluated on a single task or a single group of tasks to determine their overall performance. The evaluation is then assessed in terms of how well the embedding approach performs on the task at hand. Still, it is hardly evaluated (and often not even deeply understood) what information the embedding appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.06014","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/2207.06014/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":"2207.06014","created_at":"2026-07-05T04:39:53.817867+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.06014v1","created_at":"2026-07-05T04:39:53.817867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.06014","created_at":"2026-07-05T04:39:53.817867+00:00"},{"alias_kind":"pith_short_12","alias_value":"VUWFHRXJ67BW","created_at":"2026-07-05T04:39:53.817867+00:00"},{"alias_kind":"pith_short_16","alias_value":"VUWFHRXJ67BWALOA","created_at":"2026-07-05T04:39:53.817867+00:00"},{"alias_kind":"pith_short_8","alias_value":"VUWFHRXJ","created_at":"2026-07-05T04:39:53.817867+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/VUWFHRXJ67BWALOAWA5Y5O3AAW","json":"https://pith.science/pith/VUWFHRXJ67BWALOAWA5Y5O3AAW.json","graph_json":"https://pith.science/api/pith-number/VUWFHRXJ67BWALOAWA5Y5O3AAW/graph.json","events_json":"https://pith.science/api/pith-number/VUWFHRXJ67BWALOAWA5Y5O3AAW/events.json","paper":"https://pith.science/paper/VUWFHRXJ"},"agent_actions":{"view_html":"https://pith.science/pith/VUWFHRXJ67BWALOAWA5Y5O3AAW","download_json":"https://pith.science/pith/VUWFHRXJ67BWALOAWA5Y5O3AAW.json","view_paper":"https://pith.science/paper/VUWFHRXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.06014&json=true","fetch_graph":"https://pith.science/api/pith-number/VUWFHRXJ67BWALOAWA5Y5O3AAW/graph.json","fetch_events":"https://pith.science/api/pith-number/VUWFHRXJ67BWALOAWA5Y5O3AAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VUWFHRXJ67BWALOAWA5Y5O3AAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VUWFHRXJ67BWALOAWA5Y5O3AAW/action/storage_attestation","attest_author":"https://pith.science/pith/VUWFHRXJ67BWALOAWA5Y5O3AAW/action/author_attestation","sign_citation":"https://pith.science/pith/VUWFHRXJ67BWALOAWA5Y5O3AAW/action/citation_signature","submit_replication":"https://pith.science/pith/VUWFHRXJ67BWALOAWA5Y5O3AAW/action/replication_record"}},"created_at":"2026-07-05T04:39:53.817867+00:00","updated_at":"2026-07-05T04:39:53.817867+00:00"}