{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NASOINDTBDEJQ3KAOLDGSHG3S6","short_pith_number":"pith:NASOINDT","schema_version":"1.0","canonical_sha256":"6824e4347308c8986d4072c6691cdb979a2e1ed1333565de76af67276528f1f8","source":{"kind":"arxiv","id":"1410.7383","version":6},"attestation_state":"computed","paper":{"title":"A Ternary Non-Commutative Latent Factor Model for Scalable Three-Way Real Tensor Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Guy Baruch","submitted_at":"2014-10-26T13:08:49Z","abstract_excerpt":"Motivated by large-scale Collaborative-Filtering applications, we present a Non-Commuting Latent Factor (NCLF) tensor-completion approach for modeling three-way arrays, which is diagonal like the standard PARAFAC, but wherein different terms distinguish different kinds of three-way relations of co-clusters, as determined by permutations of latent factors. The first key component of the algebraic representation is the usage of two non-commutative real trilinear operations as the building blocks of the approximation. These operations are the standard three dimensional triple-product and a trilin"},"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":"1410.7383","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-26T13:08:49Z","cross_cats_sorted":[],"title_canon_sha256":"9e633b879706244d4e78d4594386a44357715e6d9cf629f69bb1ac908b94c81b","abstract_canon_sha256":"68ab410ae5449be87ef8b0626767e82ec40c6296da6531948b4730e26ada681f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:43.701480Z","signature_b64":"0Ug2OqctN26AGg5OFWw/jH5QoFIQIjHBHuBmKwepxvyMYahEWBjvrSrQRJ07riy+I8SHWD1I2N4C/30IaDJYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6824e4347308c8986d4072c6691cdb979a2e1ed1333565de76af67276528f1f8","last_reissued_at":"2026-05-18T01:32:43.700986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:43.700986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Ternary Non-Commutative Latent Factor Model for Scalable Three-Way Real Tensor Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Guy Baruch","submitted_at":"2014-10-26T13:08:49Z","abstract_excerpt":"Motivated by large-scale Collaborative-Filtering applications, we present a Non-Commuting Latent Factor (NCLF) tensor-completion approach for modeling three-way arrays, which is diagonal like the standard PARAFAC, but wherein different terms distinguish different kinds of three-way relations of co-clusters, as determined by permutations of latent factors. The first key component of the algebraic representation is the usage of two non-commutative real trilinear operations as the building blocks of the approximation. These operations are the standard three dimensional triple-product and a trilin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7383","kind":"arxiv","version":6},"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":"1410.7383","created_at":"2026-05-18T01:32:43.701063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7383v6","created_at":"2026-05-18T01:32:43.701063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7383","created_at":"2026-05-18T01:32:43.701063+00:00"},{"alias_kind":"pith_short_12","alias_value":"NASOINDTBDEJ","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NASOINDTBDEJQ3KA","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NASOINDT","created_at":"2026-05-18T12:28:41.024544+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/NASOINDTBDEJQ3KAOLDGSHG3S6","json":"https://pith.science/pith/NASOINDTBDEJQ3KAOLDGSHG3S6.json","graph_json":"https://pith.science/api/pith-number/NASOINDTBDEJQ3KAOLDGSHG3S6/graph.json","events_json":"https://pith.science/api/pith-number/NASOINDTBDEJQ3KAOLDGSHG3S6/events.json","paper":"https://pith.science/paper/NASOINDT"},"agent_actions":{"view_html":"https://pith.science/pith/NASOINDTBDEJQ3KAOLDGSHG3S6","download_json":"https://pith.science/pith/NASOINDTBDEJQ3KAOLDGSHG3S6.json","view_paper":"https://pith.science/paper/NASOINDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7383&json=true","fetch_graph":"https://pith.science/api/pith-number/NASOINDTBDEJQ3KAOLDGSHG3S6/graph.json","fetch_events":"https://pith.science/api/pith-number/NASOINDTBDEJQ3KAOLDGSHG3S6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NASOINDTBDEJQ3KAOLDGSHG3S6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NASOINDTBDEJQ3KAOLDGSHG3S6/action/storage_attestation","attest_author":"https://pith.science/pith/NASOINDTBDEJQ3KAOLDGSHG3S6/action/author_attestation","sign_citation":"https://pith.science/pith/NASOINDTBDEJQ3KAOLDGSHG3S6/action/citation_signature","submit_replication":"https://pith.science/pith/NASOINDTBDEJQ3KAOLDGSHG3S6/action/replication_record"}},"created_at":"2026-05-18T01:32:43.701063+00:00","updated_at":"2026-05-18T01:32:43.701063+00:00"}