{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RQJPZ2FIYCV5PPNEP6HZCHSNHB","short_pith_number":"pith:RQJPZ2FI","schema_version":"1.0","canonical_sha256":"8c12fce8a8c0abd7bda47f8f911e4d385ca24c15489e8b327bfe2a7fbe2bddf7","source":{"kind":"arxiv","id":"1512.08120","version":2},"attestation_state":"computed","paper":{"title":"Regularized Orthogonal Tensor Decompositions for Multi-Relational Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Fanhua Shang, Hong Cheng, James Cheng","submitted_at":"2015-12-26T15:26:05Z","abstract_excerpt":"Multi-relational learning has received lots of attention from researchers in various research communities. Most existing methods either suffer from superlinear per-iteration cost, or are sensitive to the given ranks. To address both issues, we propose a scalable core tensor trace norm Regularized Orthogonal Iteration Decomposition (ROID) method for full or incomplete tensor analytics, which can be generalized as a graph Laplacian regularized version by using auxiliary information or a sparse higher-order orthogonal iteration (SHOOI) version. We first induce the equivalence relation of the Scha"},"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":"1512.08120","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-26T15:26:05Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d97662d62f32b01e18b661428fb0e5e311da19ef2f1a6a9f83f2111dfbcfe493","abstract_canon_sha256":"cbf6aa384ba5dc912f6009bcd06ccd8dcb5585096fb5a92f26f7c86c9cdcaf79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:46.071180Z","signature_b64":"20sxmC0d4T3PA4ZA9RTpq7w3reuWM7uG0t0I0P78STqkAQL4hIa1yceaKtKlSkToMUUbT7/C8b9Zxq5iz+m+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c12fce8a8c0abd7bda47f8f911e4d385ca24c15489e8b327bfe2a7fbe2bddf7","last_reissued_at":"2026-05-18T01:22:46.070745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:46.070745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularized Orthogonal Tensor Decompositions for Multi-Relational Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Fanhua Shang, Hong Cheng, James Cheng","submitted_at":"2015-12-26T15:26:05Z","abstract_excerpt":"Multi-relational learning has received lots of attention from researchers in various research communities. Most existing methods either suffer from superlinear per-iteration cost, or are sensitive to the given ranks. To address both issues, we propose a scalable core tensor trace norm Regularized Orthogonal Iteration Decomposition (ROID) method for full or incomplete tensor analytics, which can be generalized as a graph Laplacian regularized version by using auxiliary information or a sparse higher-order orthogonal iteration (SHOOI) version. We first induce the equivalence relation of the Scha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08120","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":"1512.08120","created_at":"2026-05-18T01:22:46.070809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.08120v2","created_at":"2026-05-18T01:22:46.070809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08120","created_at":"2026-05-18T01:22:46.070809+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQJPZ2FIYCV5","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQJPZ2FIYCV5PPNE","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQJPZ2FI","created_at":"2026-05-18T12:29:39.896362+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/RQJPZ2FIYCV5PPNEP6HZCHSNHB","json":"https://pith.science/pith/RQJPZ2FIYCV5PPNEP6HZCHSNHB.json","graph_json":"https://pith.science/api/pith-number/RQJPZ2FIYCV5PPNEP6HZCHSNHB/graph.json","events_json":"https://pith.science/api/pith-number/RQJPZ2FIYCV5PPNEP6HZCHSNHB/events.json","paper":"https://pith.science/paper/RQJPZ2FI"},"agent_actions":{"view_html":"https://pith.science/pith/RQJPZ2FIYCV5PPNEP6HZCHSNHB","download_json":"https://pith.science/pith/RQJPZ2FIYCV5PPNEP6HZCHSNHB.json","view_paper":"https://pith.science/paper/RQJPZ2FI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.08120&json=true","fetch_graph":"https://pith.science/api/pith-number/RQJPZ2FIYCV5PPNEP6HZCHSNHB/graph.json","fetch_events":"https://pith.science/api/pith-number/RQJPZ2FIYCV5PPNEP6HZCHSNHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQJPZ2FIYCV5PPNEP6HZCHSNHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQJPZ2FIYCV5PPNEP6HZCHSNHB/action/storage_attestation","attest_author":"https://pith.science/pith/RQJPZ2FIYCV5PPNEP6HZCHSNHB/action/author_attestation","sign_citation":"https://pith.science/pith/RQJPZ2FIYCV5PPNEP6HZCHSNHB/action/citation_signature","submit_replication":"https://pith.science/pith/RQJPZ2FIYCV5PPNEP6HZCHSNHB/action/replication_record"}},"created_at":"2026-05-18T01:22:46.070809+00:00","updated_at":"2026-05-18T01:22:46.070809+00:00"}