{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CV5EHD67ELEBDHYFVL7UK347OC","short_pith_number":"pith:CV5EHD67","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"},"canonical_sha256":"157a438fdf22c8119f05aaff456f9f70b94257fa5e2fa50e597b1f31539fa2aa","source":{"kind":"arxiv","id":"1808.07452","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07452","created_at":"2026-06-04T20:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07452v2","created_at":"2026-06-04T20:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07452","created_at":"2026-06-04T20:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"CV5EHD67ELEB","created_at":"2026-06-04T20:13:16Z"},{"alias_kind":"pith_short_16","alias_value":"CV5EHD67ELEBDHYF","created_at":"2026-06-04T20:13:16Z"},{"alias_kind":"pith_short_8","alias_value":"CV5EHD67","created_at":"2026-06-04T20:13:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CV5EHD67ELEBDHYFVL7UK347OC","target":"record","payload":{"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"},"canonical_sha256":"157a438fdf22c8119f05aaff456f9f70b94257fa5e2fa50e597b1f31539fa2aa","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"},"source_kind":"arxiv","source_id":"1808.07452","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-06-04T20:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Jbm+vRiZdi/Fbyf/xMxt4nVbdKQo14yx9s76W/oBEReuJ0y+giKjADq/PtjfBNPGWdHvVD2a5SoQBThRLSGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:06:57.459959Z"},"content_sha256":"9a0dad536fb6b02aaf0ab70fba6372c92b2b8324483bb4bbba96f5a57151f247","schema_version":"1.0","event_id":"sha256:9a0dad536fb6b02aaf0ab70fba6372c92b2b8324483bb4bbba96f5a57151f247"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CV5EHD67ELEBDHYFVL7UK347OC","target":"graph","payload":{"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"},"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-06-04T20:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R/8etWWdJZso7IH5jhWvlALuFs7i0DMPycGDOiIHKQP6rm0N/RNixrMWH5+lu7MyiKh2uKdUhw5sLcs7j62ZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:06:57.460342Z"},"content_sha256":"2b6b0b091603140cfb5f13af990bba876fe7205807d31ed207528bf0d6f5202a","schema_version":"1.0","event_id":"sha256:2b6b0b091603140cfb5f13af990bba876fe7205807d31ed207528bf0d6f5202a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CV5EHD67ELEBDHYFVL7UK347OC/bundle.json","state_url":"https://pith.science/pith/CV5EHD67ELEBDHYFVL7UK347OC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CV5EHD67ELEBDHYFVL7UK347OC/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-27T04:06:57Z","links":{"resolver":"https://pith.science/pith/CV5EHD67ELEBDHYFVL7UK347OC","bundle":"https://pith.science/pith/CV5EHD67ELEBDHYFVL7UK347OC/bundle.json","state":"https://pith.science/pith/CV5EHD67ELEBDHYFVL7UK347OC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CV5EHD67ELEBDHYFVL7UK347OC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CV5EHD67ELEBDHYFVL7UK347OC","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":"f324085ecb0b96ed873aebba3b63754503891923c8132f930c7fee1d70ef113c","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-22T17:36:08Z","title_canon_sha256":"5a309447fe35b4490fc427307fcb7592ece27b63767fa0861bb62aa5e6f51702"},"schema_version":"1.0","source":{"id":"1808.07452","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07452","created_at":"2026-06-04T20:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07452v2","created_at":"2026-06-04T20:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07452","created_at":"2026-06-04T20:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"CV5EHD67ELEB","created_at":"2026-06-04T20:13:16Z"},{"alias_kind":"pith_short_16","alias_value":"CV5EHD67ELEBDHYF","created_at":"2026-06-04T20:13:16Z"},{"alias_kind":"pith_short_8","alias_value":"CV5EHD67","created_at":"2026-06-04T20:13:16Z"}],"graph_snapshots":[{"event_id":"sha256:2b6b0b091603140cfb5f13af990bba876fe7205807d31ed207528bf0d6f5202a","target":"graph","created_at":"2026-06-04T20:13:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1808.07452/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"David Hong, Jed A. Duersch, Tamara G. Kolda","cross_cats":["cs.LG","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-22T17:36:08Z","title":"Generalized Canonical Polyadic Tensor Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07452","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:9a0dad536fb6b02aaf0ab70fba6372c92b2b8324483bb4bbba96f5a57151f247","target":"record","created_at":"2026-06-04T20:13:16Z","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":"f324085ecb0b96ed873aebba3b63754503891923c8132f930c7fee1d70ef113c","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-22T17:36:08Z","title_canon_sha256":"5a309447fe35b4490fc427307fcb7592ece27b63767fa0861bb62aa5e6f51702"},"schema_version":"1.0","source":{"id":"1808.07452","kind":"arxiv","version":2}},"canonical_sha256":"157a438fdf22c8119f05aaff456f9f70b94257fa5e2fa50e597b1f31539fa2aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"157a438fdf22c8119f05aaff456f9f70b94257fa5e2fa50e597b1f31539fa2aa","first_computed_at":"2026-06-04T20:13:16.092638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T20:13:16.092638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/P1VBeCg0D9bIa7Gbsu/2uequ4rhxfYOPSbHefA7pmgjyXqH/iC/TMVgbNamluPNNN2u9heE8nu2m2LRTdjDCA==","signature_status":"signed_v1","signed_at":"2026-06-04T20:13:16.093138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.07452","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a0dad536fb6b02aaf0ab70fba6372c92b2b8324483bb4bbba96f5a57151f247","sha256:2b6b0b091603140cfb5f13af990bba876fe7205807d31ed207528bf0d6f5202a"],"state_sha256":"42868844723b201fdb0b1b07d147b22294c13d17c1c26743f3a80b5deae26bc4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5ZJyrkiZbcshK6EkILscljQLtSdLdBQ9ywPACahTYkCTMNgArNPqQAc/OcPipfjbJNkiY6kP6dLsPl+dtJ/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T04:06:57.462791Z","bundle_sha256":"ceb9e4311c173b43902439ae7b3401df66b8dfcf47112a547aae80ff3e36a45a"}}