{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:H5QVUNWMDQ6RKFLXVRMYVFNDVL","short_pith_number":"pith:H5QVUNWM","canonical_record":{"source":{"id":"2109.09391","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2021-09-20T09:37:13Z","cross_cats_sorted":[],"title_canon_sha256":"10184fd0f2c5882702f53210c0eaa36a53b6f8deac85e6236d4a1fcf254843ac","abstract_canon_sha256":"a9eacd05541ad13e0bab9574f5ff64c9d827cdc5539a844fa559d7761b281ffc"},"schema_version":"1.0"},"canonical_sha256":"3f615a36cc1c3d151577ac598a95a3aad8031ebb76b448878253d9b4c7aa5227","source":{"kind":"arxiv","id":"2109.09391","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.09391","created_at":"2026-07-05T03:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"2109.09391v1","created_at":"2026-07-05T03:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09391","created_at":"2026-07-05T03:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"H5QVUNWMDQ6R","created_at":"2026-07-05T03:15:45Z"},{"alias_kind":"pith_short_16","alias_value":"H5QVUNWMDQ6RKFLX","created_at":"2026-07-05T03:15:45Z"},{"alias_kind":"pith_short_8","alias_value":"H5QVUNWM","created_at":"2026-07-05T03:15:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:H5QVUNWMDQ6RKFLXVRMYVFNDVL","target":"record","payload":{"canonical_record":{"source":{"id":"2109.09391","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2021-09-20T09:37:13Z","cross_cats_sorted":[],"title_canon_sha256":"10184fd0f2c5882702f53210c0eaa36a53b6f8deac85e6236d4a1fcf254843ac","abstract_canon_sha256":"a9eacd05541ad13e0bab9574f5ff64c9d827cdc5539a844fa559d7761b281ffc"},"schema_version":"1.0"},"canonical_sha256":"3f615a36cc1c3d151577ac598a95a3aad8031ebb76b448878253d9b4c7aa5227","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:15:45.085630Z","signature_b64":"IpTnZhmPO0fUPG4zI77MbqzYzrF8R+eSvLOWjxwe866/p5QU6bk/P2vdFCfwQQAewgqqhJAFUW0j/ccBHLueBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f615a36cc1c3d151577ac598a95a3aad8031ebb76b448878253d9b4c7aa5227","last_reissued_at":"2026-07-05T03:15:45.085184Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:15:45.085184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.09391","source_version":1,"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-07-05T03:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pKXMAlWVqaxLpHvS1IWCPybNcnjFJQ47XPaewnHAgAp6xAbJl4NRr+Ayla/2U0H0Gt6+VJVCh1sYW6xaCQKvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T21:15:14.835364Z"},"content_sha256":"18c9a542e73371bad244241d51bb333805f822300b15793cf985b9b36c5f8b7a","schema_version":"1.0","event_id":"sha256:18c9a542e73371bad244241d51bb333805f822300b15793cf985b9b36c5f8b7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:H5QVUNWMDQ6RKFLXVRMYVFNDVL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Statistics of Knowledge Graphs Based On The Conceptual Schema","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Iztok Savnik, Kiyoshi Nitta, Nikolaus Augsten, Riste Skrekovski","submitted_at":"2021-09-20T09:37:13Z","abstract_excerpt":"In this paper, we propose a new approach for the computation of the statistics of knowledge graphs. We introduce a schema graph that represents the main framework for the computation of the statistics. The core of the procedure is an algorithm that determines the sub-graph of the schema graph affected by the insertion of one triple into the triple-store. We first present the algorithms that use the minimal schema and the complete schema of a knowledge graph. Furthermore, we propose an algorithm in which the size of the schema graph can be controlled -- it is based on the $n$ levels from the up"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.09391","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/2109.09391/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"},"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-07-05T03:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bA06e0oocigiNzVKFtZt0VSpqjsZB0ZuQawmTbbnY18sapxZfrdP1ZJnNRxfgDlTGfS2+fJffSeWjme4B31kDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T21:15:14.835750Z"},"content_sha256":"96abd93bc3c7325ad9797c1dc7416a76f99b682d78d24cb2d0e79a53e1bad279","schema_version":"1.0","event_id":"sha256:96abd93bc3c7325ad9797c1dc7416a76f99b682d78d24cb2d0e79a53e1bad279"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H5QVUNWMDQ6RKFLXVRMYVFNDVL/bundle.json","state_url":"https://pith.science/pith/H5QVUNWMDQ6RKFLXVRMYVFNDVL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H5QVUNWMDQ6RKFLXVRMYVFNDVL/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-08-13T21:15:14Z","links":{"resolver":"https://pith.science/pith/H5QVUNWMDQ6RKFLXVRMYVFNDVL","bundle":"https://pith.science/pith/H5QVUNWMDQ6RKFLXVRMYVFNDVL/bundle.json","state":"https://pith.science/pith/H5QVUNWMDQ6RKFLXVRMYVFNDVL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H5QVUNWMDQ6RKFLXVRMYVFNDVL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:H5QVUNWMDQ6RKFLXVRMYVFNDVL","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":"a9eacd05541ad13e0bab9574f5ff64c9d827cdc5539a844fa559d7761b281ffc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2021-09-20T09:37:13Z","title_canon_sha256":"10184fd0f2c5882702f53210c0eaa36a53b6f8deac85e6236d4a1fcf254843ac"},"schema_version":"1.0","source":{"id":"2109.09391","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.09391","created_at":"2026-07-05T03:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"2109.09391v1","created_at":"2026-07-05T03:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09391","created_at":"2026-07-05T03:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"H5QVUNWMDQ6R","created_at":"2026-07-05T03:15:45Z"},{"alias_kind":"pith_short_16","alias_value":"H5QVUNWMDQ6RKFLX","created_at":"2026-07-05T03:15:45Z"},{"alias_kind":"pith_short_8","alias_value":"H5QVUNWM","created_at":"2026-07-05T03:15:45Z"}],"graph_snapshots":[{"event_id":"sha256:96abd93bc3c7325ad9797c1dc7416a76f99b682d78d24cb2d0e79a53e1bad279","target":"graph","created_at":"2026-07-05T03:15:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2109.09391/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a new approach for the computation of the statistics of knowledge graphs. We introduce a schema graph that represents the main framework for the computation of the statistics. The core of the procedure is an algorithm that determines the sub-graph of the schema graph affected by the insertion of one triple into the triple-store. We first present the algorithms that use the minimal schema and the complete schema of a knowledge graph. Furthermore, we propose an algorithm in which the size of the schema graph can be controlled -- it is based on the $n$ levels from the up","authors_text":"Iztok Savnik, Kiyoshi Nitta, Nikolaus Augsten, Riste Skrekovski","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2021-09-20T09:37:13Z","title":"Statistics of Knowledge Graphs Based On The Conceptual Schema"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.09391","kind":"arxiv","version":1},"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:18c9a542e73371bad244241d51bb333805f822300b15793cf985b9b36c5f8b7a","target":"record","created_at":"2026-07-05T03:15:45Z","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":"a9eacd05541ad13e0bab9574f5ff64c9d827cdc5539a844fa559d7761b281ffc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2021-09-20T09:37:13Z","title_canon_sha256":"10184fd0f2c5882702f53210c0eaa36a53b6f8deac85e6236d4a1fcf254843ac"},"schema_version":"1.0","source":{"id":"2109.09391","kind":"arxiv","version":1}},"canonical_sha256":"3f615a36cc1c3d151577ac598a95a3aad8031ebb76b448878253d9b4c7aa5227","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f615a36cc1c3d151577ac598a95a3aad8031ebb76b448878253d9b4c7aa5227","first_computed_at":"2026-07-05T03:15:45.085184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:15:45.085184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IpTnZhmPO0fUPG4zI77MbqzYzrF8R+eSvLOWjxwe866/p5QU6bk/P2vdFCfwQQAewgqqhJAFUW0j/ccBHLueBg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:15:45.085630Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.09391","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18c9a542e73371bad244241d51bb333805f822300b15793cf985b9b36c5f8b7a","sha256:96abd93bc3c7325ad9797c1dc7416a76f99b682d78d24cb2d0e79a53e1bad279"],"state_sha256":"b7a0170e6d386f16beea900aadd24beaa91a25ef46eb3cbff6004af67decfe0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"js00bPeLmfKjMZsetVw3R/pwGo+E8p/7c3N0LkTYpdwaTK6ex7ym/3z7ubrvu9ybo9uyhIFM7NG+MIuBDolFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T21:15:14.856116Z","bundle_sha256":"e63c865eba683dd5881c2d6fe280dc1ecf92be16cc559e3b8b41a82f85d3aa25"}}