{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RQJPZ2FIYCV5PPNEP6HZCHSNHB","short_pith_number":"pith:RQJPZ2FI","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"},"canonical_sha256":"8c12fce8a8c0abd7bda47f8f911e4d385ca24c15489e8b327bfe2a7fbe2bddf7","source":{"kind":"arxiv","id":"1512.08120","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08120","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08120v2","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08120","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"pith_short_12","alias_value":"RQJPZ2FIYCV5","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RQJPZ2FIYCV5PPNE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RQJPZ2FI","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RQJPZ2FIYCV5PPNEP6HZCHSNHB","target":"record","payload":{"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"},"canonical_sha256":"8c12fce8a8c0abd7bda47f8f911e4d385ca24c15489e8b327bfe2a7fbe2bddf7","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"},"source_kind":"arxiv","source_id":"1512.08120","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-18T01:22:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O3DMAFAO6tO56Zac7BBr47UCef9HjobbwZXQSAXtJy9lYmQwNZcCV1EAeORXZnXJ6cJsQ5IXs5drUdWIn6gFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:11:33.702079Z"},"content_sha256":"dec4ffc2495347abf8a12e4552afe7ea810bbb3f1dc947ce768c0506bcd26482","schema_version":"1.0","event_id":"sha256:dec4ffc2495347abf8a12e4552afe7ea810bbb3f1dc947ce768c0506bcd26482"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RQJPZ2FIYCV5PPNEP6HZCHSNHB","target":"graph","payload":{"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"},"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-18T01:22:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54ph06BSEHPpaj4imz6smjywiBwg4cVtbML1YhvdhE9EtxoJyqSuSHtTRJ+zKf9SVcX9IDWlIzzpo5EaLKHFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:11:33.702456Z"},"content_sha256":"2dbabcbed2b353cdf036573d6976ff72c2cb4d74f15245f2e25bc5767a8cb9f3","schema_version":"1.0","event_id":"sha256:2dbabcbed2b353cdf036573d6976ff72c2cb4d74f15245f2e25bc5767a8cb9f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQJPZ2FIYCV5PPNEP6HZCHSNHB/bundle.json","state_url":"https://pith.science/pith/RQJPZ2FIYCV5PPNEP6HZCHSNHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQJPZ2FIYCV5PPNEP6HZCHSNHB/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-12T00:11:33Z","links":{"resolver":"https://pith.science/pith/RQJPZ2FIYCV5PPNEP6HZCHSNHB","bundle":"https://pith.science/pith/RQJPZ2FIYCV5PPNEP6HZCHSNHB/bundle.json","state":"https://pith.science/pith/RQJPZ2FIYCV5PPNEP6HZCHSNHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQJPZ2FIYCV5PPNEP6HZCHSNHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RQJPZ2FIYCV5PPNEP6HZCHSNHB","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":"cbf6aa384ba5dc912f6009bcd06ccd8dcb5585096fb5a92f26f7c86c9cdcaf79","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-26T15:26:05Z","title_canon_sha256":"d97662d62f32b01e18b661428fb0e5e311da19ef2f1a6a9f83f2111dfbcfe493"},"schema_version":"1.0","source":{"id":"1512.08120","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08120","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08120v2","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08120","created_at":"2026-05-18T01:22:46Z"},{"alias_kind":"pith_short_12","alias_value":"RQJPZ2FIYCV5","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RQJPZ2FIYCV5PPNE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RQJPZ2FI","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:2dbabcbed2b353cdf036573d6976ff72c2cb4d74f15245f2e25bc5767a8cb9f3","target":"graph","created_at":"2026-05-18T01:22:46Z","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":"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","authors_text":"Fanhua Shang, Hong Cheng, James Cheng","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-26T15:26:05Z","title":"Regularized Orthogonal Tensor Decompositions for Multi-Relational Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08120","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:dec4ffc2495347abf8a12e4552afe7ea810bbb3f1dc947ce768c0506bcd26482","target":"record","created_at":"2026-05-18T01:22:46Z","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":"cbf6aa384ba5dc912f6009bcd06ccd8dcb5585096fb5a92f26f7c86c9cdcaf79","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-26T15:26:05Z","title_canon_sha256":"d97662d62f32b01e18b661428fb0e5e311da19ef2f1a6a9f83f2111dfbcfe493"},"schema_version":"1.0","source":{"id":"1512.08120","kind":"arxiv","version":2}},"canonical_sha256":"8c12fce8a8c0abd7bda47f8f911e4d385ca24c15489e8b327bfe2a7fbe2bddf7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c12fce8a8c0abd7bda47f8f911e4d385ca24c15489e8b327bfe2a7fbe2bddf7","first_computed_at":"2026-05-18T01:22:46.070745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:46.070745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"20sxmC0d4T3PA4ZA9RTpq7w3reuWM7uG0t0I0P78STqkAQL4hIa1yceaKtKlSkToMUUbT7/C8b9Zxq5iz+m+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:46.071180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.08120","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dec4ffc2495347abf8a12e4552afe7ea810bbb3f1dc947ce768c0506bcd26482","sha256:2dbabcbed2b353cdf036573d6976ff72c2cb4d74f15245f2e25bc5767a8cb9f3"],"state_sha256":"8e2ec45e1651ec39a74f3677df00741bcfb7106a3bcb0477dce3f2049996f570"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CGXw2nb5U3pgLacZtnruW9Dct55jmWGXxBbTFkE7hB0KBgvwZ+4qcBUYes2kfPTqx+dZzHKC/CWwCZ8n3AAQCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:11:33.706035Z","bundle_sha256":"7fef82e8203fef57cf9890566b6f42a2729c151b90960fad55f9ee04a615eecf"}}