{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DBV6UMW2IEP6Z2JSUR3IRTHYUS","short_pith_number":"pith:DBV6UMW2","schema_version":"1.0","canonical_sha256":"186bea32da411fece932a47688ccf8a4aa07512d5f7c8ae5d1155391a6eb4176","source":{"kind":"arxiv","id":"1407.1399","version":1},"attestation_state":"computed","paper":{"title":"Generalized Higher-Order Tensor Decomposition via Parallel ADMM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NA","authors_text":"Fanhua Shang, James Cheng, Yuanyuan Liu","submitted_at":"2014-07-05T11:58:30Z","abstract_excerpt":"Higher-order tensors are becoming prevalent in many scientific areas such as computer vision, social network analysis, data mining and neuroscience. Traditional tensor decomposition approaches face three major challenges: model selecting, gross corruptions and computational efficiency. To address these problems, we first propose a parallel trace norm regularized tensor decomposition method, and formulate it as a convex optimization problem. This method does not require the rank of each mode to be specified beforehand, and can automatically determine the number of factors in each mode through o"},"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":"1407.1399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-07-05T11:58:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"37b8f526c98e082f862eced868775f3b0d400673cce76dfe512d4b9c15fdb1c2","abstract_canon_sha256":"f73b2f5aaf2e186d176c25685eeabf6e0d04d588e479bbc16285d395700ed6a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:16.674624Z","signature_b64":"LNdMvF5IHRJhCfrxQ1ladJ91M5NzVP6k+m9/ZKYY+yCiNAPsMJ/haG288Pz5yhYPXttWkUPWeJ+yEdNf/CdBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"186bea32da411fece932a47688ccf8a4aa07512d5f7c8ae5d1155391a6eb4176","last_reissued_at":"2026-05-18T02:48:16.674062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:16.674062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Higher-Order Tensor Decomposition via Parallel ADMM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NA","authors_text":"Fanhua Shang, James Cheng, Yuanyuan Liu","submitted_at":"2014-07-05T11:58:30Z","abstract_excerpt":"Higher-order tensors are becoming prevalent in many scientific areas such as computer vision, social network analysis, data mining and neuroscience. Traditional tensor decomposition approaches face three major challenges: model selecting, gross corruptions and computational efficiency. To address these problems, we first propose a parallel trace norm regularized tensor decomposition method, and formulate it as a convex optimization problem. This method does not require the rank of each mode to be specified beforehand, and can automatically determine the number of factors in each mode through o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1399","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.1399","created_at":"2026-05-18T02:48:16.674137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1399v1","created_at":"2026-05-18T02:48:16.674137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1399","created_at":"2026-05-18T02:48:16.674137+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBV6UMW2IEP6","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBV6UMW2IEP6Z2JS","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBV6UMW2","created_at":"2026-05-18T12:28:25.294606+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/DBV6UMW2IEP6Z2JSUR3IRTHYUS","json":"https://pith.science/pith/DBV6UMW2IEP6Z2JSUR3IRTHYUS.json","graph_json":"https://pith.science/api/pith-number/DBV6UMW2IEP6Z2JSUR3IRTHYUS/graph.json","events_json":"https://pith.science/api/pith-number/DBV6UMW2IEP6Z2JSUR3IRTHYUS/events.json","paper":"https://pith.science/paper/DBV6UMW2"},"agent_actions":{"view_html":"https://pith.science/pith/DBV6UMW2IEP6Z2JSUR3IRTHYUS","download_json":"https://pith.science/pith/DBV6UMW2IEP6Z2JSUR3IRTHYUS.json","view_paper":"https://pith.science/paper/DBV6UMW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1399&json=true","fetch_graph":"https://pith.science/api/pith-number/DBV6UMW2IEP6Z2JSUR3IRTHYUS/graph.json","fetch_events":"https://pith.science/api/pith-number/DBV6UMW2IEP6Z2JSUR3IRTHYUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBV6UMW2IEP6Z2JSUR3IRTHYUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBV6UMW2IEP6Z2JSUR3IRTHYUS/action/storage_attestation","attest_author":"https://pith.science/pith/DBV6UMW2IEP6Z2JSUR3IRTHYUS/action/author_attestation","sign_citation":"https://pith.science/pith/DBV6UMW2IEP6Z2JSUR3IRTHYUS/action/citation_signature","submit_replication":"https://pith.science/pith/DBV6UMW2IEP6Z2JSUR3IRTHYUS/action/replication_record"}},"created_at":"2026-05-18T02:48:16.674137+00:00","updated_at":"2026-05-18T02:48:16.674137+00:00"}