{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HYGVQ2LGY4BJ653QYG45AQ3LVY","short_pith_number":"pith:HYGVQ2LG","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"},"canonical_sha256":"3e0d586966c7029f7770c1b9d0436bae23bef7e2bd739452785ed6d645339928","source":{"kind":"arxiv","id":"1604.04795","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04795","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04795v2","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04795","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"pith_short_12","alias_value":"HYGVQ2LGY4BJ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HYGVQ2LGY4BJ653Q","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HYGVQ2LG","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HYGVQ2LGY4BJ653QYG45AQ3LVY","target":"record","payload":{"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"},"canonical_sha256":"3e0d586966c7029f7770c1b9d0436bae23bef7e2bd739452785ed6d645339928","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"},"source_kind":"arxiv","source_id":"1604.04795","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aSRGUqYJcuheZ9pGzuqYzOGenTblHD278Nk5/q4NIKzAdKTEbRMmgmVBYiaD7p8PoXcYIDMBozuHrgs2hI2TCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:21:11.300828Z"},"content_sha256":"f2e41878cff7935d048f4acb72207039fbeac70b82d08d601fc613a5de2cfabf","schema_version":"1.0","event_id":"sha256:f2e41878cff7935d048f4acb72207039fbeac70b82d08d601fc613a5de2cfabf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HYGVQ2LGY4BJ653QYG45AQ3LVY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"apfJnTXzFpHn3b1MOEpVQyiwxPku1JSYYMBC2TScf64sXa2OlAhLPE3RRpNw8N6nZ/VdU5FvmiLWXkYOlAMwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:21:11.301175Z"},"content_sha256":"9a41562232aff2c6a12b28923ed222b82ba6e6634b0adb344729959f654b7538","schema_version":"1.0","event_id":"sha256:9a41562232aff2c6a12b28923ed222b82ba6e6634b0adb344729959f654b7538"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HYGVQ2LGY4BJ653QYG45AQ3LVY/bundle.json","state_url":"https://pith.science/pith/HYGVQ2LGY4BJ653QYG45AQ3LVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HYGVQ2LGY4BJ653QYG45AQ3LVY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T12:21:11Z","links":{"resolver":"https://pith.science/pith/HYGVQ2LGY4BJ653QYG45AQ3LVY","bundle":"https://pith.science/pith/HYGVQ2LGY4BJ653QYG45AQ3LVY/bundle.json","state":"https://pith.science/pith/HYGVQ2LGY4BJ653QYG45AQ3LVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HYGVQ2LGY4BJ653QYG45AQ3LVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HYGVQ2LGY4BJ653QYG45AQ3LVY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8cf3e9855d77f273726036c44eb649fee89949f6cfb7fe6826841a653a752070","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-16T20:54:12Z","title_canon_sha256":"92f3109590d823cab9f6ba181719dc45fd347785622460a90474d5c32fea996c"},"schema_version":"1.0","source":{"id":"1604.04795","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04795","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04795v2","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04795","created_at":"2026-05-18T01:11:17Z"},{"alias_kind":"pith_short_12","alias_value":"HYGVQ2LGY4BJ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HYGVQ2LGY4BJ653Q","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HYGVQ2LG","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:9a41562232aff2c6a12b28923ed222b82ba6e6634b0adb344729959f654b7538","target":"graph","created_at":"2026-05-18T01:11:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Gerhard Weikum, Jacopo Urbani, Sairam Gurajada, Sourav Dutta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-16T20:54:12Z","title":"KOGNAC: Efficient Encoding of Large Knowledge Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04795","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f2e41878cff7935d048f4acb72207039fbeac70b82d08d601fc613a5de2cfabf","target":"record","created_at":"2026-05-18T01:11:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8cf3e9855d77f273726036c44eb649fee89949f6cfb7fe6826841a653a752070","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-16T20:54:12Z","title_canon_sha256":"92f3109590d823cab9f6ba181719dc45fd347785622460a90474d5c32fea996c"},"schema_version":"1.0","source":{"id":"1604.04795","kind":"arxiv","version":2}},"canonical_sha256":"3e0d586966c7029f7770c1b9d0436bae23bef7e2bd739452785ed6d645339928","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e0d586966c7029f7770c1b9d0436bae23bef7e2bd739452785ed6d645339928","first_computed_at":"2026-05-18T01:11:17.310746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:17.310746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xB2T5OMgtNI+LqE0YpTnG21pfUM0WW2USAOlwm7/Y554m0T4OgPQGUM1LN2W2lRzYxMtVgRuO+iu/atoopgQCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:17.311403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04795","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2e41878cff7935d048f4acb72207039fbeac70b82d08d601fc613a5de2cfabf","sha256:9a41562232aff2c6a12b28923ed222b82ba6e6634b0adb344729959f654b7538"],"state_sha256":"2ef5e80533665ec8965a4d138186999599d594a98d2799b740a54fb6bbc944d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nIkqL7pitXnstTIHQtMMk+YiIpRVI/Yb028BIlt9IPnGm+lmqm6LgCGYMPVsHxPIjXn1EYaXAJ6E/Vp9gtD5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T12:21:11.303094Z","bundle_sha256":"9b2f6cbd2df513d2c6d3a9afe25b88ba9d8e6d123ff2d392fa4158645debe756"}}