{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QQMBPPCW5FN7M2JHNGMVNIUU7A","short_pith_number":"pith:QQMBPPCW","canonical_record":{"source":{"id":"1911.09419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-21T11:37:18Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"ed482b19ad5d13d558d1e23bad3de9f7dcdc49497b743f97b81844da323a1d6b","abstract_canon_sha256":"261305d6dbb10c66886951f04387224a70a88e9b0e69089ed4c06cfd51204a2f"},"schema_version":"1.0"},"canonical_sha256":"841817bc56e95bf66927699956a294f81ac3baa8f9579a868cdadabe92b68fc6","source":{"kind":"arxiv","id":"1911.09419","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.09419","created_at":"2026-07-05T04:11:59Z"},{"alias_kind":"arxiv_version","alias_value":"1911.09419v3","created_at":"2026-07-05T04:11:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.09419","created_at":"2026-07-05T04:11:59Z"},{"alias_kind":"pith_short_12","alias_value":"QQMBPPCW5FN7","created_at":"2026-07-05T04:11:59Z"},{"alias_kind":"pith_short_16","alias_value":"QQMBPPCW5FN7M2JH","created_at":"2026-07-05T04:11:59Z"},{"alias_kind":"pith_short_8","alias_value":"QQMBPPCW","created_at":"2026-07-05T04:11:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QQMBPPCW5FN7M2JHNGMVNIUU7A","target":"record","payload":{"canonical_record":{"source":{"id":"1911.09419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-21T11:37:18Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"ed482b19ad5d13d558d1e23bad3de9f7dcdc49497b743f97b81844da323a1d6b","abstract_canon_sha256":"261305d6dbb10c66886951f04387224a70a88e9b0e69089ed4c06cfd51204a2f"},"schema_version":"1.0"},"canonical_sha256":"841817bc56e95bf66927699956a294f81ac3baa8f9579a868cdadabe92b68fc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:11:59.567847Z","signature_b64":"xH/3sw8ONVxvDgzHJLFVGAeamNgcQucsYfZm7dpQ4/tPyTL7nqMjMMIAEX4pjeBNiySWqhl1J6Wot8iCR622Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"841817bc56e95bf66927699956a294f81ac3baa8f9579a868cdadabe92b68fc6","last_reissued_at":"2026-07-05T04:11:59.567434Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:11:59.567434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.09419","source_version":3,"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-05T04:11:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dHlZnNbWEHyl2wQ2+dDpF9sK+mPRAw5lK0VWkq1fKYpSF8R6C785Lm9nI7ms6PTpcCdHslpSiSneeeRIOTyiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:31:47.750174Z"},"content_sha256":"73fac007ef85d0eda5681aba3996a3136cf2fefd821965b1b32371ca3731870e","schema_version":"1.0","event_id":"sha256:73fac007ef85d0eda5681aba3996a3136cf2fefd821965b1b32371ca3731870e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QQMBPPCW5FN7M2JHNGMVNIUU7A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jianyu Cai, Jie Wang, Yongdong Zhang, Zhanqiu Zhang","submitted_at":"2019-11-21T11:37:18Z","abstract_excerpt":"Knowledge graph embedding, which aims to represent entities and relations as low dimensional vectors (or matrices, tensors, etc.), has been shown to be a powerful technique for predicting missing links in knowledge graphs. Existing knowledge graph embedding models mainly focus on modeling relation patterns such as symmetry/antisymmetry, inversion, and composition. However, many existing approaches fail to model semantic hierarchies, which are common in real-world applications. To address this challenge, we propose a novel knowledge graph embedding model -- namely, Hierarchy-Aware Knowledge Gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.09419","kind":"arxiv","version":3},"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/1911.09419/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-05T04:11:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"drdvYnED8hpYLx/HedDx5+zf4U8w8KFhKwTAhhlnoVhESoHnU57zuG83wcZ8H80tLUnIJbVGblSJitkE968hAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:31:47.750689Z"},"content_sha256":"09b4b8f2e9324d23fafc67744e669fcf0b55279ec13b8d1d0c4b2a54401fa1a5","schema_version":"1.0","event_id":"sha256:09b4b8f2e9324d23fafc67744e669fcf0b55279ec13b8d1d0c4b2a54401fa1a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQMBPPCW5FN7M2JHNGMVNIUU7A/bundle.json","state_url":"https://pith.science/pith/QQMBPPCW5FN7M2JHNGMVNIUU7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQMBPPCW5FN7M2JHNGMVNIUU7A/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-12T20:31:47Z","links":{"resolver":"https://pith.science/pith/QQMBPPCW5FN7M2JHNGMVNIUU7A","bundle":"https://pith.science/pith/QQMBPPCW5FN7M2JHNGMVNIUU7A/bundle.json","state":"https://pith.science/pith/QQMBPPCW5FN7M2JHNGMVNIUU7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQMBPPCW5FN7M2JHNGMVNIUU7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QQMBPPCW5FN7M2JHNGMVNIUU7A","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":"261305d6dbb10c66886951f04387224a70a88e9b0e69089ed4c06cfd51204a2f","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-21T11:37:18Z","title_canon_sha256":"ed482b19ad5d13d558d1e23bad3de9f7dcdc49497b743f97b81844da323a1d6b"},"schema_version":"1.0","source":{"id":"1911.09419","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.09419","created_at":"2026-07-05T04:11:59Z"},{"alias_kind":"arxiv_version","alias_value":"1911.09419v3","created_at":"2026-07-05T04:11:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.09419","created_at":"2026-07-05T04:11:59Z"},{"alias_kind":"pith_short_12","alias_value":"QQMBPPCW5FN7","created_at":"2026-07-05T04:11:59Z"},{"alias_kind":"pith_short_16","alias_value":"QQMBPPCW5FN7M2JH","created_at":"2026-07-05T04:11:59Z"},{"alias_kind":"pith_short_8","alias_value":"QQMBPPCW","created_at":"2026-07-05T04:11:59Z"}],"graph_snapshots":[{"event_id":"sha256:09b4b8f2e9324d23fafc67744e669fcf0b55279ec13b8d1d0c4b2a54401fa1a5","target":"graph","created_at":"2026-07-05T04:11:59Z","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/1911.09419/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Knowledge graph embedding, which aims to represent entities and relations as low dimensional vectors (or matrices, tensors, etc.), has been shown to be a powerful technique for predicting missing links in knowledge graphs. Existing knowledge graph embedding models mainly focus on modeling relation patterns such as symmetry/antisymmetry, inversion, and composition. However, many existing approaches fail to model semantic hierarchies, which are common in real-world applications. To address this challenge, we propose a novel knowledge graph embedding model -- namely, Hierarchy-Aware Knowledge Gra","authors_text":"Jianyu Cai, Jie Wang, Yongdong Zhang, Zhanqiu Zhang","cross_cats":["cs.CL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-21T11:37:18Z","title":"Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.09419","kind":"arxiv","version":3},"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:73fac007ef85d0eda5681aba3996a3136cf2fefd821965b1b32371ca3731870e","target":"record","created_at":"2026-07-05T04:11:59Z","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":"261305d6dbb10c66886951f04387224a70a88e9b0e69089ed4c06cfd51204a2f","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-21T11:37:18Z","title_canon_sha256":"ed482b19ad5d13d558d1e23bad3de9f7dcdc49497b743f97b81844da323a1d6b"},"schema_version":"1.0","source":{"id":"1911.09419","kind":"arxiv","version":3}},"canonical_sha256":"841817bc56e95bf66927699956a294f81ac3baa8f9579a868cdadabe92b68fc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"841817bc56e95bf66927699956a294f81ac3baa8f9579a868cdadabe92b68fc6","first_computed_at":"2026-07-05T04:11:59.567434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:11:59.567434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xH/3sw8ONVxvDgzHJLFVGAeamNgcQucsYfZm7dpQ4/tPyTL7nqMjMMIAEX4pjeBNiySWqhl1J6Wot8iCR622Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:11:59.567847Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.09419","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73fac007ef85d0eda5681aba3996a3136cf2fefd821965b1b32371ca3731870e","sha256:09b4b8f2e9324d23fafc67744e669fcf0b55279ec13b8d1d0c4b2a54401fa1a5"],"state_sha256":"68f20bd62f5f2d5bc78835dc170298b138b4d4527e5a91621fdf60e8768ebafe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zG56/2HcfwflrM3DFkuRM409UCRHFSjaAMExuCEHOvAy/NDbqFCtzwjQZ7KbmEs9kxwFKbvlW0SFkz5QZckaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T20:31:47.755650Z","bundle_sha256":"7821204bdeef5eb45743c27c7c2f37370601db8c2010cf027d7f3af613a93cdb"}}