{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HYGVQ2LGY4BJ653QYG45AQ3LVY","short_pith_number":"pith:HYGVQ2LG","schema_version":"1.0","canonical_sha256":"3e0d586966c7029f7770c1b9d0436bae23bef7e2bd739452785ed6d645339928","source":{"kind":"arxiv","id":"1604.04795","version":2},"attestation_state":"computed","paper":{"title":"KOGNAC: Efficient Encoding of Large Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gerhard Weikum, Jacopo Urbani, Sairam Gurajada, Sourav Dutta","submitted_at":"2016-04-16T20:54:12Z","abstract_excerpt":"Many Web applications require efficient querying of large Knowledge Graphs (KGs). We propose KOGNAC, a dictionary-encoding algorithm designed to improve SPARQL querying with a judicious combination of statistical and semantic techniques. In KOGNAC, frequent terms are detected with a frequency approximation algorithm and encoded to maximise compression. Infrequent terms are semantically grouped into ontological classes and encoded to increase data locality. We evaluated KOGNAC in combination with state-of-the-art RDF engines, and observed that it significantly improves SPARQL querying on KGs wi"},"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":"1604.04795","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-16T20:54:12Z","cross_cats_sorted":[],"title_canon_sha256":"92f3109590d823cab9f6ba181719dc45fd347785622460a90474d5c32fea996c","abstract_canon_sha256":"8cf3e9855d77f273726036c44eb649fee89949f6cfb7fe6826841a653a752070"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:17.311403Z","signature_b64":"xB2T5OMgtNI+LqE0YpTnG21pfUM0WW2USAOlwm7/Y554m0T4OgPQGUM1LN2W2lRzYxMtVgRuO+iu/atoopgQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e0d586966c7029f7770c1b9d0436bae23bef7e2bd739452785ed6d645339928","last_reissued_at":"2026-05-18T01:11:17.310746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:17.310746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KOGNAC: Efficient Encoding of Large Knowledge Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gerhard Weikum, Jacopo Urbani, Sairam Gurajada, Sourav Dutta","submitted_at":"2016-04-16T20:54:12Z","abstract_excerpt":"Many Web applications require efficient querying of large Knowledge Graphs (KGs). We propose KOGNAC, a dictionary-encoding algorithm designed to improve SPARQL querying with a judicious combination of statistical and semantic techniques. In KOGNAC, frequent terms are detected with a frequency approximation algorithm and encoded to maximise compression. Infrequent terms are semantically grouped into ontological classes and encoded to increase data locality. We evaluated KOGNAC in combination with state-of-the-art RDF engines, and observed that it significantly improves SPARQL querying on KGs wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04795","kind":"arxiv","version":2},"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":"1604.04795","created_at":"2026-05-18T01:11:17.310831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04795v2","created_at":"2026-05-18T01:11:17.310831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04795","created_at":"2026-05-18T01:11:17.310831+00:00"},{"alias_kind":"pith_short_12","alias_value":"HYGVQ2LGY4BJ","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HYGVQ2LGY4BJ653Q","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HYGVQ2LG","created_at":"2026-05-18T12:30:22.444734+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/HYGVQ2LGY4BJ653QYG45AQ3LVY","json":"https://pith.science/pith/HYGVQ2LGY4BJ653QYG45AQ3LVY.json","graph_json":"https://pith.science/api/pith-number/HYGVQ2LGY4BJ653QYG45AQ3LVY/graph.json","events_json":"https://pith.science/api/pith-number/HYGVQ2LGY4BJ653QYG45AQ3LVY/events.json","paper":"https://pith.science/paper/HYGVQ2LG"},"agent_actions":{"view_html":"https://pith.science/pith/HYGVQ2LGY4BJ653QYG45AQ3LVY","download_json":"https://pith.science/pith/HYGVQ2LGY4BJ653QYG45AQ3LVY.json","view_paper":"https://pith.science/paper/HYGVQ2LG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04795&json=true","fetch_graph":"https://pith.science/api/pith-number/HYGVQ2LGY4BJ653QYG45AQ3LVY/graph.json","fetch_events":"https://pith.science/api/pith-number/HYGVQ2LGY4BJ653QYG45AQ3LVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HYGVQ2LGY4BJ653QYG45AQ3LVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HYGVQ2LGY4BJ653QYG45AQ3LVY/action/storage_attestation","attest_author":"https://pith.science/pith/HYGVQ2LGY4BJ653QYG45AQ3LVY/action/author_attestation","sign_citation":"https://pith.science/pith/HYGVQ2LGY4BJ653QYG45AQ3LVY/action/citation_signature","submit_replication":"https://pith.science/pith/HYGVQ2LGY4BJ653QYG45AQ3LVY/action/replication_record"}},"created_at":"2026-05-18T01:11:17.310831+00:00","updated_at":"2026-05-18T01:11:17.310831+00:00"}