{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CV5EHD67ELEBDHYFVL7UK347OC","short_pith_number":"pith:CV5EHD67","schema_version":"1.0","canonical_sha256":"157a438fdf22c8119f05aaff456f9f70b94257fa5e2fa50e597b1f31539fa2aa","source":{"kind":"arxiv","id":"1808.07452","version":2},"attestation_state":"computed","paper":{"title":"Generalized Canonical Polyadic Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA"],"primary_cat":"math.NA","authors_text":"David Hong, Jed A. Duersch, Tamara G. Kolda","submitted_at":"2018-08-22T17:36:08Z","abstract_excerpt":"Tensor decomposition is a fundamental unsupervised machine learning method in data science, with applications including network analysis and sensor data processing. This work develops a generalized canonical polyadic (GCP) low-rank tensor decomposition that allows other loss functions besides squared error. For instance, we can use logistic loss or Kullback-Leibler divergence, enabling tensor decomposition for binary or count data. We present a variety statistically-motivated loss functions for various scenarios. We provide a generalized framework for computing gradients and handling missing d"},"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":"1808.07452","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-22T17:36:08Z","cross_cats_sorted":["cs.LG","cs.NA"],"title_canon_sha256":"5a309447fe35b4490fc427307fcb7592ece27b63767fa0861bb62aa5e6f51702","abstract_canon_sha256":"f324085ecb0b96ed873aebba3b63754503891923c8132f930c7fee1d70ef113c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T20:13:16.093138Z","signature_b64":"/P1VBeCg0D9bIa7Gbsu/2uequ4rhxfYOPSbHefA7pmgjyXqH/iC/TMVgbNamluPNNN2u9heE8nu2m2LRTdjDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"157a438fdf22c8119f05aaff456f9f70b94257fa5e2fa50e597b1f31539fa2aa","last_reissued_at":"2026-06-04T20:13:16.092638Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T20:13:16.092638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Canonical Polyadic Tensor Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA"],"primary_cat":"math.NA","authors_text":"David Hong, Jed A. Duersch, Tamara G. Kolda","submitted_at":"2018-08-22T17:36:08Z","abstract_excerpt":"Tensor decomposition is a fundamental unsupervised machine learning method in data science, with applications including network analysis and sensor data processing. This work develops a generalized canonical polyadic (GCP) low-rank tensor decomposition that allows other loss functions besides squared error. For instance, we can use logistic loss or Kullback-Leibler divergence, enabling tensor decomposition for binary or count data. We present a variety statistically-motivated loss functions for various scenarios. We provide a generalized framework for computing gradients and handling missing d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07452","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1808.07452/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1808.07452","created_at":"2026-06-04T20:13:16.092697+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07452v2","created_at":"2026-06-04T20:13:16.092697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07452","created_at":"2026-06-04T20:13:16.092697+00:00"},{"alias_kind":"pith_short_12","alias_value":"CV5EHD67ELEB","created_at":"2026-06-04T20:13:16.092697+00:00"},{"alias_kind":"pith_short_16","alias_value":"CV5EHD67ELEBDHYF","created_at":"2026-06-04T20:13:16.092697+00:00"},{"alias_kind":"pith_short_8","alias_value":"CV5EHD67","created_at":"2026-06-04T20:13:16.092697+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/CV5EHD67ELEBDHYFVL7UK347OC","json":"https://pith.science/pith/CV5EHD67ELEBDHYFVL7UK347OC.json","graph_json":"https://pith.science/api/pith-number/CV5EHD67ELEBDHYFVL7UK347OC/graph.json","events_json":"https://pith.science/api/pith-number/CV5EHD67ELEBDHYFVL7UK347OC/events.json","paper":"https://pith.science/paper/CV5EHD67"},"agent_actions":{"view_html":"https://pith.science/pith/CV5EHD67ELEBDHYFVL7UK347OC","download_json":"https://pith.science/pith/CV5EHD67ELEBDHYFVL7UK347OC.json","view_paper":"https://pith.science/paper/CV5EHD67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07452&json=true","fetch_graph":"https://pith.science/api/pith-number/CV5EHD67ELEBDHYFVL7UK347OC/graph.json","fetch_events":"https://pith.science/api/pith-number/CV5EHD67ELEBDHYFVL7UK347OC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CV5EHD67ELEBDHYFVL7UK347OC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CV5EHD67ELEBDHYFVL7UK347OC/action/storage_attestation","attest_author":"https://pith.science/pith/CV5EHD67ELEBDHYFVL7UK347OC/action/author_attestation","sign_citation":"https://pith.science/pith/CV5EHD67ELEBDHYFVL7UK347OC/action/citation_signature","submit_replication":"https://pith.science/pith/CV5EHD67ELEBDHYFVL7UK347OC/action/replication_record"}},"created_at":"2026-06-04T20:13:16.092697+00:00","updated_at":"2026-06-04T20:13:16.092697+00:00"}