{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WUDFDUTRVRZESPEFMVBXGCSNGJ","short_pith_number":"pith:WUDFDUTR","schema_version":"1.0","canonical_sha256":"b50651d271ac72493c856543730a4d327467081cbb581ef6d4cec639147e3d68","source":{"kind":"arxiv","id":"1303.1733","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.1733","created_at":"2026-05-18T03:22:05.365832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1733v2","created_at":"2026-05-18T03:22:05.365832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1733","created_at":"2026-05-18T03:22:05.365832+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUDFDUTRVRZE","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUDFDUTRVRZESPEF","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUDFDUTR","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ","json":"https://pith.science/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ.json","graph_json":"https://pith.science/api/pith-number/WUDFDUTRVRZESPEFMVBXGCSNGJ/graph.json","events_json":"https://pith.science/api/pith-number/WUDFDUTRVRZESPEFMVBXGCSNGJ/events.json","paper":"https://pith.science/paper/WUDFDUTR"},"agent_actions":{"view_html":"https://pith.science/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ","download_json":"https://pith.science/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ.json","view_paper":"https://pith.science/paper/WUDFDUTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1733&json=true","fetch_graph":"https://pith.science/api/pith-number/WUDFDUTRVRZESPEFMVBXGCSNGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WUDFDUTRVRZESPEFMVBXGCSNGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ/action/storage_attestation","attest_author":"https://pith.science/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ/action/author_attestation","sign_citation":"https://pith.science/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ/action/citation_signature","submit_replication":"https://pith.science/pith/WUDFDUTRVRZESPEFMVBXGCSNGJ/action/replication_record"}},"created_at":"2026-05-18T03:22:05.365832+00:00","updated_at":"2026-05-18T03:22:05.365832+00:00"}