{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WUDFDUTRVRZESPEFMVBXGCSNGJ","short_pith_number":"pith:WUDFDUTR","canonical_record":{"source":{"id":"1303.1733","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-07T16:10:44Z","cross_cats_sorted":[],"title_canon_sha256":"6642243f9951c7ad18c3270d5b556fc7d9ae232726fd08fd59f965ff0dab5ccc","abstract_canon_sha256":"7f88027b87b896f1159560e3b1aefe3c0020b3f4277cb2506d424abb4ec01bf9"},"schema_version":"1.0"},"canonical_sha256":"b50651d271ac72493c856543730a4d327467081cbb581ef6d4cec639147e3d68","source":{"kind":"arxiv","id":"1303.1733","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1733","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1733v2","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1733","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"WUDFDUTRVRZE","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WUDFDUTRVRZESPEF","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WUDFDUTR","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WUDFDUTRVRZESPEFMVBXGCSNGJ","target":"record","payload":{"canonical_record":{"source":{"id":"1303.1733","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-07T16:10:44Z","cross_cats_sorted":[],"title_canon_sha256":"6642243f9951c7ad18c3270d5b556fc7d9ae232726fd08fd59f965ff0dab5ccc","abstract_canon_sha256":"7f88027b87b896f1159560e3b1aefe3c0020b3f4277cb2506d424abb4ec01bf9"},"schema_version":"1.0"},"canonical_sha256":"b50651d271ac72493c856543730a4d327467081cbb581ef6d4cec639147e3d68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:05.366513Z","signature_b64":"wVTNucBTdSgA4KCyRh6BM1B3RIQpv1Ev5++keqFcpttbJahh8NCQTXYWuOD2VXjbJEI9m/VwNXstiI7Y067mDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b50651d271ac72493c856543730a4d327467081cbb581ef6d4cec639147e3d68","last_reissued_at":"2026-05-18T03:22:05.365709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:05.365709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.1733","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-18T03:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QeuoO9dHyYPBnLVXApEANUj5ghBrUsOalcmm3C6+26i9o+wNi/CxbdwHO45bFmFs92a8VwLbdZdba4f1zqsCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:00:40.073193Z"},"content_sha256":"71d25c22b77fea5518300d4a5f270a616e8a47eca0aa32ad1bf583a71ce97183","schema_version":"1.0","event_id":"sha256:71d25c22b77fea5518300d4a5f270a616e8a47eca0aa32ad1bf583a71ce97183"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WUDFDUTRVRZESPEFMVBXGCSNGJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-relational Learning Using Weighted Tensor Decomposition with Modular Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ben London, Bert Huang, Lise Getoor, Theodoros Rekatsinas","submitted_at":"2013-03-07T16:10:44Z","abstract_excerpt":"We propose a modular framework for multi-relational learning via tensor decomposition. In our learning setting, the training data contains multiple types of relationships among a set of objects, which we represent by a sparse three-mode tensor. The goal is to predict the values of the missing entries. To do so, we model each relationship as a function of a linear combination of latent factors. We learn this latent representation by computing a low-rank tensor decomposition, using quasi-Newton optimization of a weighted objective function. Sparsity in the observed data is captured by the weight"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1733","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-18T03:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qArfoOGvMw2jbo4IBhJcW73mvzHpOgwOwWXh7i+E9ttLV/jppl1wghi5AW9qALlDiLO/RAVPtD+KYxEnoRieBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:00:40.073574Z"},"content_sha256":"2b7c8bfbbbec857cf298684fe5c6f30a5c1e5d27cfae9c1e3900bfb0b692f7de","schema_version":"1.0","event_id":"sha256:2b7c8bfbbbec857cf298684fe5c6f30a5c1e5d27cfae9c1e3900bfb0b692f7de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ/bundle.json","state_url":"https://pith.science/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ/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-31T19:00:40Z","links":{"resolver":"https://pith.science/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ","bundle":"https://pith.science/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ/bundle.json","state":"https://pith.science/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WUDFDUTRVRZESPEFMVBXGCSNGJ","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":"7f88027b87b896f1159560e3b1aefe3c0020b3f4277cb2506d424abb4ec01bf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-07T16:10:44Z","title_canon_sha256":"6642243f9951c7ad18c3270d5b556fc7d9ae232726fd08fd59f965ff0dab5ccc"},"schema_version":"1.0","source":{"id":"1303.1733","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1733","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1733v2","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1733","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"WUDFDUTRVRZE","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WUDFDUTRVRZESPEF","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WUDFDUTR","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:2b7c8bfbbbec857cf298684fe5c6f30a5c1e5d27cfae9c1e3900bfb0b692f7de","target":"graph","created_at":"2026-05-18T03:22:05Z","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 propose a modular framework for multi-relational learning via tensor decomposition. In our learning setting, the training data contains multiple types of relationships among a set of objects, which we represent by a sparse three-mode tensor. The goal is to predict the values of the missing entries. To do so, we model each relationship as a function of a linear combination of latent factors. We learn this latent representation by computing a low-rank tensor decomposition, using quasi-Newton optimization of a weighted objective function. Sparsity in the observed data is captured by the weight","authors_text":"Ben London, Bert Huang, Lise Getoor, Theodoros Rekatsinas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-07T16:10:44Z","title":"Multi-relational Learning Using Weighted Tensor Decomposition with Modular Loss"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1733","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:71d25c22b77fea5518300d4a5f270a616e8a47eca0aa32ad1bf583a71ce97183","target":"record","created_at":"2026-05-18T03:22:05Z","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":"7f88027b87b896f1159560e3b1aefe3c0020b3f4277cb2506d424abb4ec01bf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-07T16:10:44Z","title_canon_sha256":"6642243f9951c7ad18c3270d5b556fc7d9ae232726fd08fd59f965ff0dab5ccc"},"schema_version":"1.0","source":{"id":"1303.1733","kind":"arxiv","version":2}},"canonical_sha256":"b50651d271ac72493c856543730a4d327467081cbb581ef6d4cec639147e3d68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b50651d271ac72493c856543730a4d327467081cbb581ef6d4cec639147e3d68","first_computed_at":"2026-05-18T03:22:05.365709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:05.365709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wVTNucBTdSgA4KCyRh6BM1B3RIQpv1Ev5++keqFcpttbJahh8NCQTXYWuOD2VXjbJEI9m/VwNXstiI7Y067mDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:05.366513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1733","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71d25c22b77fea5518300d4a5f270a616e8a47eca0aa32ad1bf583a71ce97183","sha256:2b7c8bfbbbec857cf298684fe5c6f30a5c1e5d27cfae9c1e3900bfb0b692f7de"],"state_sha256":"d031c898eaf6aae49da366cb3ecbb2444a119e289f665da00a0dd7da50b924cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jmO3z+ZObhKVD3Z/qIl+1JTodtjLeLGUU1GMvzW9J79vYwrz+/6sKFB5eIViWjamFyfgqW2/lvzk0tZfWmrTBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:00:40.075544Z","bundle_sha256":"61803d4ab359b4dc1326fddac6b64614ead31d4f50eb95c7d910214de8704879"}}