{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5EAEW2X7A346OYJUDDZXQJSJ72","short_pith_number":"pith:5EAEW2X7","schema_version":"1.0","canonical_sha256":"e9004b6aff06f9e7613418f3782649fe9089d5cbd4cb2a0a5d0bd1c8145a3afa","source":{"kind":"arxiv","id":"2102.10588","version":1},"attestation_state":"computed","paper":{"title":"LMKG: Learned Models for Cardinality Estimation in Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Angjela Davitkova, Damjan Gjurovski, Sebastian Michel","submitted_at":"2021-02-21T11:45:22Z","abstract_excerpt":"Accurate cardinality estimates are a key ingredient to achieve optimal query plans. For RDF engines, specifically under common knowledge graph processing workloads, the lack of schema, correlated predicates, and various types of queries involving multiple joins, render cardinality estimation a particularly challenging task. In this paper, we develop a framework, termed LMKG, that adopts deep learning approaches for effectively estimating the cardinality of queries over RDF graphs. We employ both supervised (i.e., deep neural networks) and unsupervised (i.e., autoregressive models) approaches t"},"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.10588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-02-21T11:45:22Z","cross_cats_sorted":[],"title_canon_sha256":"d50785afae1dfe2432849c1821dad5be8f041462658b0054a9fb7dff975e3fb0","abstract_canon_sha256":"cc23fd7e43a45c7cb55dbc970403bf51aa5a8368775159f40bdcd23192b84307"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:16:59.651006Z","signature_b64":"ny99eTflrRU4WyHdfG+ls6OqnchbIxsaXQlIhdt/fdjZ8IAW2bbZEe3nLVbsrGY/FDV6FeBNsDblGGh6Bz8jAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9004b6aff06f9e7613418f3782649fe9089d5cbd4cb2a0a5d0bd1c8145a3afa","last_reissued_at":"2026-07-05T02:16:59.650623Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:16:59.650623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LMKG: Learned Models for Cardinality Estimation in Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Angjela Davitkova, Damjan Gjurovski, Sebastian Michel","submitted_at":"2021-02-21T11:45:22Z","abstract_excerpt":"Accurate cardinality estimates are a key ingredient to achieve optimal query plans. For RDF engines, specifically under common knowledge graph processing workloads, the lack of schema, correlated predicates, and various types of queries involving multiple joins, render cardinality estimation a particularly challenging task. In this paper, we develop a framework, termed LMKG, that adopts deep learning approaches for effectively estimating the cardinality of queries over RDF graphs. We employ both supervised (i.e., deep neural networks) and unsupervised (i.e., autoregressive models) approaches t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.10588","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.10588/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.10588","created_at":"2026-07-05T02:16:59.650681+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.10588v1","created_at":"2026-07-05T02:16:59.650681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.10588","created_at":"2026-07-05T02:16:59.650681+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EAEW2X7A346","created_at":"2026-07-05T02:16:59.650681+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EAEW2X7A346OYJU","created_at":"2026-07-05T02:16:59.650681+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EAEW2X7","created_at":"2026-07-05T02:16:59.650681+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/5EAEW2X7A346OYJUDDZXQJSJ72","json":"https://pith.science/pith/5EAEW2X7A346OYJUDDZXQJSJ72.json","graph_json":"https://pith.science/api/pith-number/5EAEW2X7A346OYJUDDZXQJSJ72/graph.json","events_json":"https://pith.science/api/pith-number/5EAEW2X7A346OYJUDDZXQJSJ72/events.json","paper":"https://pith.science/paper/5EAEW2X7"},"agent_actions":{"view_html":"https://pith.science/pith/5EAEW2X7A346OYJUDDZXQJSJ72","download_json":"https://pith.science/pith/5EAEW2X7A346OYJUDDZXQJSJ72.json","view_paper":"https://pith.science/paper/5EAEW2X7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.10588&json=true","fetch_graph":"https://pith.science/api/pith-number/5EAEW2X7A346OYJUDDZXQJSJ72/graph.json","fetch_events":"https://pith.science/api/pith-number/5EAEW2X7A346OYJUDDZXQJSJ72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EAEW2X7A346OYJUDDZXQJSJ72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EAEW2X7A346OYJUDDZXQJSJ72/action/storage_attestation","attest_author":"https://pith.science/pith/5EAEW2X7A346OYJUDDZXQJSJ72/action/author_attestation","sign_citation":"https://pith.science/pith/5EAEW2X7A346OYJUDDZXQJSJ72/action/citation_signature","submit_replication":"https://pith.science/pith/5EAEW2X7A346OYJUDDZXQJSJ72/action/replication_record"}},"created_at":"2026-07-05T02:16:59.650681+00:00","updated_at":"2026-07-05T02:16:59.650681+00:00"}