{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2PZJDJJOOU5RKCR3QKMMEWHSYG","short_pith_number":"pith:2PZJDJJO","canonical_record":{"source":{"id":"1809.02382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-07T10:00:53Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"f0f64cf0bf17b527792ee5f1c5e5ef675d714c715ee89f649c6a395a7d3e7ea3","abstract_canon_sha256":"9e9de0cf3292bdbf634f1692dedd5170d9cddcc0e571cc1392bcb751f7fd01bc"},"schema_version":"1.0"},"canonical_sha256":"d3f291a52e753b150a3b8298c258f2c1892200dec0a3f0f1624f8c3bc8793a2f","source":{"kind":"arxiv","id":"1809.02382","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02382","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02382v1","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02382","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"2PZJDJJOOU5R","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2PZJDJJOOU5RKCR3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2PZJDJJO","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2PZJDJJOOU5RKCR3QKMMEWHSYG","target":"record","payload":{"canonical_record":{"source":{"id":"1809.02382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-07T10:00:53Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"f0f64cf0bf17b527792ee5f1c5e5ef675d714c715ee89f649c6a395a7d3e7ea3","abstract_canon_sha256":"9e9de0cf3292bdbf634f1692dedd5170d9cddcc0e571cc1392bcb751f7fd01bc"},"schema_version":"1.0"},"canonical_sha256":"d3f291a52e753b150a3b8298c258f2c1892200dec0a3f0f1624f8c3bc8793a2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:17.275614Z","signature_b64":"Wuq45ZOBf+JsnkKGNDl1ZlclrtcNW/ERkhtKqhkgqrKBdDfkOHAMJriHdl1fudJZQ2Oq7H0AadgVg+RlLOdPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3f291a52e753b150a3b8298c258f2c1892200dec0a3f0f1624f8c3bc8793a2f","last_reissued_at":"2026-05-18T00:06:17.275107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:17.275107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.02382","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-05-18T00:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dkElHJUzwBrgV+GM08MwSU/G8YLon0flWK44/sVCBfgxEfG92K+ASAocRyYkdKPyjepvfNkwaa0KcXuFIjuNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:49:41.869835Z"},"content_sha256":"9597e56733b81b9e8b6d95c199f7d20799e686f37ffe5482c50010e31088a219","schema_version":"1.0","event_id":"sha256:9597e56733b81b9e8b6d95c199f7d20799e686f37ffe5482c50010e31088a219"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2PZJDJJOOU5RKCR3QKMMEWHSYG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On2Vec: Embedding-based Relation Prediction for Ontology Population","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.AI","authors_text":"Carlo Zaniolo, Muhao Chen, Xuelu Chen, Yingtao Tian, Zijun Xue","submitted_at":"2018-09-07T10:00:53Z","abstract_excerpt":"Populating ontology graphs represents a long-standing problem for the Semantic Web community. Recent advances in translation-based graph embedding methods for populating instance-level knowledge graphs lead to promising new approaching for the ontology population problem. However, unlike instance-level graphs, the majority of relation facts in ontology graphs come with comprehensive semantic relations, which often include the properties of transitivity and symmetry, as well as hierarchical relations. These comprehensive relations are often too complex for existing graph embedding methods, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02382","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"},"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-18T00:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CSr6p+6nEk8smzcfgZnG8/TsWEpt3viyAiXYGVkONDoYy5WY39P/OzLdx/tBdCRiIk1fcjV+wpgpefi/4pyIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:49:41.870403Z"},"content_sha256":"c459eaef90f1a92d95332fb5258452bba92517e4d6f7f9488a01b201cdfc3a69","schema_version":"1.0","event_id":"sha256:c459eaef90f1a92d95332fb5258452bba92517e4d6f7f9488a01b201cdfc3a69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PZJDJJOOU5RKCR3QKMMEWHSYG/bundle.json","state_url":"https://pith.science/pith/2PZJDJJOOU5RKCR3QKMMEWHSYG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PZJDJJOOU5RKCR3QKMMEWHSYG/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-05-30T22:49:41Z","links":{"resolver":"https://pith.science/pith/2PZJDJJOOU5RKCR3QKMMEWHSYG","bundle":"https://pith.science/pith/2PZJDJJOOU5RKCR3QKMMEWHSYG/bundle.json","state":"https://pith.science/pith/2PZJDJJOOU5RKCR3QKMMEWHSYG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PZJDJJOOU5RKCR3QKMMEWHSYG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2PZJDJJOOU5RKCR3QKMMEWHSYG","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":"9e9de0cf3292bdbf634f1692dedd5170d9cddcc0e571cc1392bcb751f7fd01bc","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-07T10:00:53Z","title_canon_sha256":"f0f64cf0bf17b527792ee5f1c5e5ef675d714c715ee89f649c6a395a7d3e7ea3"},"schema_version":"1.0","source":{"id":"1809.02382","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02382","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02382v1","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02382","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"2PZJDJJOOU5R","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2PZJDJJOOU5RKCR3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2PZJDJJO","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:c459eaef90f1a92d95332fb5258452bba92517e4d6f7f9488a01b201cdfc3a69","target":"graph","created_at":"2026-05-18T00:06: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":"Populating ontology graphs represents a long-standing problem for the Semantic Web community. Recent advances in translation-based graph embedding methods for populating instance-level knowledge graphs lead to promising new approaching for the ontology population problem. However, unlike instance-level graphs, the majority of relation facts in ontology graphs come with comprehensive semantic relations, which often include the properties of transitivity and symmetry, as well as hierarchical relations. These comprehensive relations are often too complex for existing graph embedding methods, and ","authors_text":"Carlo Zaniolo, Muhao Chen, Xuelu Chen, Yingtao Tian, Zijun Xue","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-07T10:00:53Z","title":"On2Vec: Embedding-based Relation Prediction for Ontology Population"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02382","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:9597e56733b81b9e8b6d95c199f7d20799e686f37ffe5482c50010e31088a219","target":"record","created_at":"2026-05-18T00:06: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":"9e9de0cf3292bdbf634f1692dedd5170d9cddcc0e571cc1392bcb751f7fd01bc","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-07T10:00:53Z","title_canon_sha256":"f0f64cf0bf17b527792ee5f1c5e5ef675d714c715ee89f649c6a395a7d3e7ea3"},"schema_version":"1.0","source":{"id":"1809.02382","kind":"arxiv","version":1}},"canonical_sha256":"d3f291a52e753b150a3b8298c258f2c1892200dec0a3f0f1624f8c3bc8793a2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3f291a52e753b150a3b8298c258f2c1892200dec0a3f0f1624f8c3bc8793a2f","first_computed_at":"2026-05-18T00:06:17.275107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:17.275107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wuq45ZOBf+JsnkKGNDl1ZlclrtcNW/ERkhtKqhkgqrKBdDfkOHAMJriHdl1fudJZQ2Oq7H0AadgVg+RlLOdPCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:17.275614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02382","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9597e56733b81b9e8b6d95c199f7d20799e686f37ffe5482c50010e31088a219","sha256:c459eaef90f1a92d95332fb5258452bba92517e4d6f7f9488a01b201cdfc3a69"],"state_sha256":"d50238b59e2fb0172f43e0fcbae3b8415c199f8c332a7712acb23f47f4c093be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y0alggeRfTNRGwhahv32IoSmYJHCBS0x/S9Pn+vokMe2rgg9rIbBmWy5nP/Aib5PYeux4XduOq59cQlCvQTJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:49:41.873593Z","bundle_sha256":"f964061e6edb502be8b982180c4c5933a83ee1e2df72345abf1db59977fc8939"}}