{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FEB3RFBDXF42YSQFM6PELVOX7Q","short_pith_number":"pith:FEB3RFBD","canonical_record":{"source":{"id":"1805.02408","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-07T09:03:14Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"f23827375d13dab9d0f38e38eb9f13fa3ba47d32042a613caca64f6f16c263e4","abstract_canon_sha256":"838652ef68d8123be360e0dfa8de075f19784cca0019672439faf6b53083ec53"},"schema_version":"1.0"},"canonical_sha256":"2903b89423b979ac4a05679e45d5d7fc0a4eae422a47a51bc74e51bf01ea237a","source":{"kind":"arxiv","id":"1805.02408","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02408","created_at":"2026-05-18T00:13:59Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02408v2","created_at":"2026-05-18T00:13:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02408","created_at":"2026-05-18T00:13:59Z"},{"alias_kind":"pith_short_12","alias_value":"FEB3RFBDXF42","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FEB3RFBDXF42YSQF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FEB3RFBD","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FEB3RFBDXF42YSQFM6PELVOX7Q","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02408","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-07T09:03:14Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"f23827375d13dab9d0f38e38eb9f13fa3ba47d32042a613caca64f6f16c263e4","abstract_canon_sha256":"838652ef68d8123be360e0dfa8de075f19784cca0019672439faf6b53083ec53"},"schema_version":"1.0"},"canonical_sha256":"2903b89423b979ac4a05679e45d5d7fc0a4eae422a47a51bc74e51bf01ea237a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:59.736592Z","signature_b64":"Mvf0kAKT2ImUMnVQvjdONBFKUidqOg+y7YYJaqkpL76Y3ymkBz0UyDRsJHX5SzSWXWubuQeahM0PinpiI4OsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2903b89423b979ac4a05679e45d5d7fc0a4eae422a47a51bc74e51bf01ea237a","last_reissued_at":"2026-05-18T00:13:59.735881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:59.735881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02408","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-18T00:13:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IAacrhzo5bMcQuho42f2b5J59DQ+5qbUjO9ZCvoz/QO9a/jrGb/Hr/sSncRuAHMA5rfOwQK7f6K9oRKy+NwvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T10:06:06.707323Z"},"content_sha256":"8f7a2343f44564ef83805fc7078512cd0dc456e65c6d04106fb6733a95aaebde","schema_version":"1.0","event_id":"sha256:8f7a2343f44564ef83805fc7078512cd0dc456e65c6d04106fb6733a95aaebde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FEB3RFBDXF42YSQFM6PELVOX7Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Knowledge Graph Embedding Using Simple Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Bin Wang, Boyang Ding, Li Guo, Quan Wang","submitted_at":"2018-05-07T09:03:14Z","abstract_excerpt":"Embedding knowledge graphs (KGs) into continuous vector spaces is a focus of current research. Early works performed this task via simple models developed over KG triples. Recent attempts focused on either designing more complicated triple scoring models, or incorporating extra information beyond triples. This paper, by contrast, investigates the potential of using very simple constraints to improve KG embedding. We examine non-negativity constraints on entity representations and approximate entailment constraints on relation representations. The former help to learn compact and interpretable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02408","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-18T00:13:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fICq//qiXm5cvwax86jOrEP/be1cTop0lxLUCrAwoli4LYm8NmLDyK6bxiZoppQDAud50hi6AzvpeOxV3keaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T10:06:06.707986Z"},"content_sha256":"2ab92b9d2c5853321ac8d53d0650ad89d978b36c303d6c583d0eacbde2157b06","schema_version":"1.0","event_id":"sha256:2ab92b9d2c5853321ac8d53d0650ad89d978b36c303d6c583d0eacbde2157b06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEB3RFBDXF42YSQFM6PELVOX7Q/bundle.json","state_url":"https://pith.science/pith/FEB3RFBDXF42YSQFM6PELVOX7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEB3RFBDXF42YSQFM6PELVOX7Q/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-20T10:06:06Z","links":{"resolver":"https://pith.science/pith/FEB3RFBDXF42YSQFM6PELVOX7Q","bundle":"https://pith.science/pith/FEB3RFBDXF42YSQFM6PELVOX7Q/bundle.json","state":"https://pith.science/pith/FEB3RFBDXF42YSQFM6PELVOX7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEB3RFBDXF42YSQFM6PELVOX7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FEB3RFBDXF42YSQFM6PELVOX7Q","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":"838652ef68d8123be360e0dfa8de075f19784cca0019672439faf6b53083ec53","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-07T09:03:14Z","title_canon_sha256":"f23827375d13dab9d0f38e38eb9f13fa3ba47d32042a613caca64f6f16c263e4"},"schema_version":"1.0","source":{"id":"1805.02408","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02408","created_at":"2026-05-18T00:13:59Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02408v2","created_at":"2026-05-18T00:13:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02408","created_at":"2026-05-18T00:13:59Z"},{"alias_kind":"pith_short_12","alias_value":"FEB3RFBDXF42","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FEB3RFBDXF42YSQF","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FEB3RFBD","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:2ab92b9d2c5853321ac8d53d0650ad89d978b36c303d6c583d0eacbde2157b06","target":"graph","created_at":"2026-05-18T00:13: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"},"paper":{"abstract_excerpt":"Embedding knowledge graphs (KGs) into continuous vector spaces is a focus of current research. Early works performed this task via simple models developed over KG triples. Recent attempts focused on either designing more complicated triple scoring models, or incorporating extra information beyond triples. This paper, by contrast, investigates the potential of using very simple constraints to improve KG embedding. We examine non-negativity constraints on entity representations and approximate entailment constraints on relation representations. The former help to learn compact and interpretable ","authors_text":"Bin Wang, Boyang Ding, Li Guo, Quan Wang","cross_cats":["cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-07T09:03:14Z","title":"Improving Knowledge Graph Embedding Using Simple Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02408","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:8f7a2343f44564ef83805fc7078512cd0dc456e65c6d04106fb6733a95aaebde","target":"record","created_at":"2026-05-18T00:13: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":"838652ef68d8123be360e0dfa8de075f19784cca0019672439faf6b53083ec53","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-07T09:03:14Z","title_canon_sha256":"f23827375d13dab9d0f38e38eb9f13fa3ba47d32042a613caca64f6f16c263e4"},"schema_version":"1.0","source":{"id":"1805.02408","kind":"arxiv","version":2}},"canonical_sha256":"2903b89423b979ac4a05679e45d5d7fc0a4eae422a47a51bc74e51bf01ea237a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2903b89423b979ac4a05679e45d5d7fc0a4eae422a47a51bc74e51bf01ea237a","first_computed_at":"2026-05-18T00:13:59.735881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:59.735881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mvf0kAKT2ImUMnVQvjdONBFKUidqOg+y7YYJaqkpL76Y3ymkBz0UyDRsJHX5SzSWXWubuQeahM0PinpiI4OsAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:59.736592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02408","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f7a2343f44564ef83805fc7078512cd0dc456e65c6d04106fb6733a95aaebde","sha256:2ab92b9d2c5853321ac8d53d0650ad89d978b36c303d6c583d0eacbde2157b06"],"state_sha256":"54f088a80d9bb1b238998f0a059be057a7e529fa70c1e6b9c1ab839ed774f5b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnzI1M7n2YNvPaZOsnCyPnfQyTk16f8DtCXmff3XEYlScQR8L6PVZZ4vmGkcpXP7SJfGsPOuoAqfV8l+df+9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T10:06:06.713255Z","bundle_sha256":"1decef6147d42ff6974901a099af668d24dab85a504ddce1e04f9518096e4748"}}