{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:R5LDKZI2FJR7QTCFUYZEHT6FQQ","short_pith_number":"pith:R5LDKZI2","canonical_record":{"source":{"id":"1709.04808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-14T14:21:33Z","cross_cats_sorted":[],"title_canon_sha256":"f2b9b43c214f44684dfaaa62ba707405dd2ee3cad188b77c12aa86a65a763611","abstract_canon_sha256":"38a6f0a67b2b64346491f2d33c8f895b60a3f01f7c06d5f435041af9f68ba547"},"schema_version":"1.0"},"canonical_sha256":"8f5635651a2a63f84c45a63243cfc5842ec3b907506c5bf904628117bc4ee379","source":{"kind":"arxiv","id":"1709.04808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04808","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04808v1","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04808","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"pith_short_12","alias_value":"R5LDKZI2FJR7","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R5LDKZI2FJR7QTCF","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R5LDKZI2","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:R5LDKZI2FJR7QTCFUYZEHT6FQQ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.04808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-14T14:21:33Z","cross_cats_sorted":[],"title_canon_sha256":"f2b9b43c214f44684dfaaa62ba707405dd2ee3cad188b77c12aa86a65a763611","abstract_canon_sha256":"38a6f0a67b2b64346491f2d33c8f895b60a3f01f7c06d5f435041af9f68ba547"},"schema_version":"1.0"},"canonical_sha256":"8f5635651a2a63f84c45a63243cfc5842ec3b907506c5bf904628117bc4ee379","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:10.102989Z","signature_b64":"IIBOnczZJrFPVPo9ugs8KJVzmiNOogDQQbPKsaZXplrHNZd4q5e3B+9w5BubFAScLPXl0Ie3qVCeToQKvfwkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f5635651a2a63f84c45a63243cfc5842ec3b907506c5bf904628117bc4ee379","last_reissued_at":"2026-05-18T00:35:10.102409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:10.102409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.04808","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:35:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RnpRGd0QC+LRGTlt1cOg4ssfNxCkU/eQ/mVGHhGJPL/yrx2oVB4PZ1RgHX6+m0LCChbqU9pmYXfXYG+g7bdJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:15:00.880217Z"},"content_sha256":"06233d691dbd26eba20cb0e64fd83a2f5fc9c9456d15f04809c114d3a2579fd4","schema_version":"1.0","event_id":"sha256:06233d691dbd26eba20cb0e64fd83a2f5fc9c9456d15f04809c114d3a2579fd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:R5LDKZI2FJR7QTCFUYZEHT6FQQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Multi-Relational Link Prediction with Bilinear Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hui Li, Rainer Gemulla, Yanjie Wang","submitted_at":"2017-09-14T14:21:33Z","abstract_excerpt":"We study bilinear embedding models for the task of multi-relational link prediction and knowledge graph completion. Bilinear models belong to the most basic models for this task, they are comparably efficient to train and use, and they can provide good prediction performance. The main goal of this paper is to explore the expressiveness of and the connections between various bilinear models proposed in the literature. In particular, a substantial number of models can be represented as bilinear models with certain additional constraints enforced on the embeddings. We explore whether or not these"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04808","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:35:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZPySGPEVHZvqVQ3CWfsLmggGJYGFNZf1QQdlAq+Ez9rxawd2yroyEr62FD+rY03ssbyv8nfNVQOQNWiqmniBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:15:00.880890Z"},"content_sha256":"64464d12a1afc7db4f8fdf61ee0cb9e332dd549fe20df42f5eb38cfab83bbabb","schema_version":"1.0","event_id":"sha256:64464d12a1afc7db4f8fdf61ee0cb9e332dd549fe20df42f5eb38cfab83bbabb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R5LDKZI2FJR7QTCFUYZEHT6FQQ/bundle.json","state_url":"https://pith.science/pith/R5LDKZI2FJR7QTCFUYZEHT6FQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R5LDKZI2FJR7QTCFUYZEHT6FQQ/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-06-07T16:15:00Z","links":{"resolver":"https://pith.science/pith/R5LDKZI2FJR7QTCFUYZEHT6FQQ","bundle":"https://pith.science/pith/R5LDKZI2FJR7QTCFUYZEHT6FQQ/bundle.json","state":"https://pith.science/pith/R5LDKZI2FJR7QTCFUYZEHT6FQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R5LDKZI2FJR7QTCFUYZEHT6FQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:R5LDKZI2FJR7QTCFUYZEHT6FQQ","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":"38a6f0a67b2b64346491f2d33c8f895b60a3f01f7c06d5f435041af9f68ba547","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-14T14:21:33Z","title_canon_sha256":"f2b9b43c214f44684dfaaa62ba707405dd2ee3cad188b77c12aa86a65a763611"},"schema_version":"1.0","source":{"id":"1709.04808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04808","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04808v1","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04808","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"pith_short_12","alias_value":"R5LDKZI2FJR7","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R5LDKZI2FJR7QTCF","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R5LDKZI2","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:64464d12a1afc7db4f8fdf61ee0cb9e332dd549fe20df42f5eb38cfab83bbabb","target":"graph","created_at":"2026-05-18T00:35:10Z","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":"We study bilinear embedding models for the task of multi-relational link prediction and knowledge graph completion. Bilinear models belong to the most basic models for this task, they are comparably efficient to train and use, and they can provide good prediction performance. The main goal of this paper is to explore the expressiveness of and the connections between various bilinear models proposed in the literature. In particular, a substantial number of models can be represented as bilinear models with certain additional constraints enforced on the embeddings. We explore whether or not these","authors_text":"Hui Li, Rainer Gemulla, Yanjie Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-14T14:21:33Z","title":"On Multi-Relational Link Prediction with Bilinear Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04808","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:06233d691dbd26eba20cb0e64fd83a2f5fc9c9456d15f04809c114d3a2579fd4","target":"record","created_at":"2026-05-18T00:35:10Z","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":"38a6f0a67b2b64346491f2d33c8f895b60a3f01f7c06d5f435041af9f68ba547","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-14T14:21:33Z","title_canon_sha256":"f2b9b43c214f44684dfaaa62ba707405dd2ee3cad188b77c12aa86a65a763611"},"schema_version":"1.0","source":{"id":"1709.04808","kind":"arxiv","version":1}},"canonical_sha256":"8f5635651a2a63f84c45a63243cfc5842ec3b907506c5bf904628117bc4ee379","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f5635651a2a63f84c45a63243cfc5842ec3b907506c5bf904628117bc4ee379","first_computed_at":"2026-05-18T00:35:10.102409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:10.102409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IIBOnczZJrFPVPo9ugs8KJVzmiNOogDQQbPKsaZXplrHNZd4q5e3B+9w5BubFAScLPXl0Ie3qVCeToQKvfwkAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:10.102989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06233d691dbd26eba20cb0e64fd83a2f5fc9c9456d15f04809c114d3a2579fd4","sha256:64464d12a1afc7db4f8fdf61ee0cb9e332dd549fe20df42f5eb38cfab83bbabb"],"state_sha256":"29824fd0ac5f6557355aa90f5d43a6952b6290bc184493f0f1f00f92ecf2961b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qziDW04N1hjptlvlik/0p58hY0fag3MH9XXftsVuXb9g7aplco51/eoHXXbT9aR5bxtVlqeBuSq2p5U0KKkFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:15:00.884385Z","bundle_sha256":"aa1f3e07a7d9753b8c064c04a921b4d1152c2d79681a0aa3ade885cd0ef71881"}}