{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WM2AV5BDEPBFLY5JSJ4H7E3EMK","short_pith_number":"pith:WM2AV5BD","schema_version":"1.0","canonical_sha256":"b3340af42323c255e3a992787f9364629c3254ab45b9b0fe64280164bb83c3e9","source":{"kind":"arxiv","id":"1809.11099","version":1},"attestation_state":"computed","paper":{"title":"Which Knowledge Graph Is Best for Me?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.AI","authors_text":"Achim Rettinger, Michael F\\\"arber","submitted_at":"2018-09-28T15:44:21Z","abstract_excerpt":"In recent years, DBpedia, Freebase, OpenCyc, Wikidata, and YAGO have been published as noteworthy large, cross-domain, and freely available knowledge graphs. Although extensively in use, these knowledge graphs are hard to compare against each other in a given setting. Thus, it is a challenge for researchers and developers to pick the best knowledge graph for their individual needs. In our recent survey, we devised and applied data quality criteria to the above-mentioned knowledge graphs. Furthermore, we proposed a framework for finding the most suitable knowledge graph for a given setting. Wit"},"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":"1809.11099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-28T15:44:21Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"64c57bad8604aaea0f1c470839d39728936e688ae99c6217c341c5bf29050f3d","abstract_canon_sha256":"c4bf2bedf4e1348ae7872a9855781ede85b32b24a8ac04d61e297e34b51507c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:33.300408Z","signature_b64":"n5YuVkvKz1SA+0IviZnK7VC2P6pMSTyMxV5Ihkt3Q8Q39PtRRAe0ODapwzWVTiLxtjZJ08sLjtY65cRZO6TbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3340af42323c255e3a992787f9364629c3254ab45b9b0fe64280164bb83c3e9","last_reissued_at":"2026-05-18T00:04:33.299834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:33.299834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Which Knowledge Graph Is Best for Me?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.AI","authors_text":"Achim Rettinger, Michael F\\\"arber","submitted_at":"2018-09-28T15:44:21Z","abstract_excerpt":"In recent years, DBpedia, Freebase, OpenCyc, Wikidata, and YAGO have been published as noteworthy large, cross-domain, and freely available knowledge graphs. Although extensively in use, these knowledge graphs are hard to compare against each other in a given setting. Thus, it is a challenge for researchers and developers to pick the best knowledge graph for their individual needs. In our recent survey, we devised and applied data quality criteria to the above-mentioned knowledge graphs. Furthermore, we proposed a framework for finding the most suitable knowledge graph for a given setting. Wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.11099","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":""},"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":"1809.11099","created_at":"2026-05-18T00:04:33.299917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.11099v1","created_at":"2026-05-18T00:04:33.299917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.11099","created_at":"2026-05-18T00:04:33.299917+00:00"},{"alias_kind":"pith_short_12","alias_value":"WM2AV5BDEPBF","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WM2AV5BDEPBFLY5J","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WM2AV5BD","created_at":"2026-05-18T12:33:01.666342+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/WM2AV5BDEPBFLY5JSJ4H7E3EMK","json":"https://pith.science/pith/WM2AV5BDEPBFLY5JSJ4H7E3EMK.json","graph_json":"https://pith.science/api/pith-number/WM2AV5BDEPBFLY5JSJ4H7E3EMK/graph.json","events_json":"https://pith.science/api/pith-number/WM2AV5BDEPBFLY5JSJ4H7E3EMK/events.json","paper":"https://pith.science/paper/WM2AV5BD"},"agent_actions":{"view_html":"https://pith.science/pith/WM2AV5BDEPBFLY5JSJ4H7E3EMK","download_json":"https://pith.science/pith/WM2AV5BDEPBFLY5JSJ4H7E3EMK.json","view_paper":"https://pith.science/paper/WM2AV5BD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.11099&json=true","fetch_graph":"https://pith.science/api/pith-number/WM2AV5BDEPBFLY5JSJ4H7E3EMK/graph.json","fetch_events":"https://pith.science/api/pith-number/WM2AV5BDEPBFLY5JSJ4H7E3EMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WM2AV5BDEPBFLY5JSJ4H7E3EMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WM2AV5BDEPBFLY5JSJ4H7E3EMK/action/storage_attestation","attest_author":"https://pith.science/pith/WM2AV5BDEPBFLY5JSJ4H7E3EMK/action/author_attestation","sign_citation":"https://pith.science/pith/WM2AV5BDEPBFLY5JSJ4H7E3EMK/action/citation_signature","submit_replication":"https://pith.science/pith/WM2AV5BDEPBFLY5JSJ4H7E3EMK/action/replication_record"}},"created_at":"2026-05-18T00:04:33.299917+00:00","updated_at":"2026-05-18T00:04:33.299917+00:00"}