{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4XRBKSRATL2GRLLNOEMG3FFR2W","short_pith_number":"pith:4XRBKSRA","canonical_record":{"source":{"id":"2605.20353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-19T18:06:47Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"b8e4184a6c02e85b60ab6fb83e5582f6ea075609d2a52bfa6885f5de8b259266","abstract_canon_sha256":"aa3451e5fe4cca9b3234dfa98ef072aecea5dcf3e20cdbeea50059cbfe902541"},"schema_version":"1.0"},"canonical_sha256":"e5e2154a209af468ad6d71186d94b1d5bc0e4a9627dcb86d44e7fef675586670","source":{"kind":"arxiv","id":"2605.20353","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20353","created_at":"2026-05-21T01:04:34Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20353v1","created_at":"2026-05-21T01:04:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20353","created_at":"2026-05-21T01:04:34Z"},{"alias_kind":"pith_short_12","alias_value":"4XRBKSRATL2G","created_at":"2026-05-21T01:04:34Z"},{"alias_kind":"pith_short_16","alias_value":"4XRBKSRATL2GRLLN","created_at":"2026-05-21T01:04:34Z"},{"alias_kind":"pith_short_8","alias_value":"4XRBKSRA","created_at":"2026-05-21T01:04:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4XRBKSRATL2GRLLNOEMG3FFR2W","target":"record","payload":{"canonical_record":{"source":{"id":"2605.20353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-19T18:06:47Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"b8e4184a6c02e85b60ab6fb83e5582f6ea075609d2a52bfa6885f5de8b259266","abstract_canon_sha256":"aa3451e5fe4cca9b3234dfa98ef072aecea5dcf3e20cdbeea50059cbfe902541"},"schema_version":"1.0"},"canonical_sha256":"e5e2154a209af468ad6d71186d94b1d5bc0e4a9627dcb86d44e7fef675586670","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:34.553024Z","signature_b64":"qC8J0mnSziyTEZUcZuU/eN9E7HcxVHm17O9p7LotEKba/HpB8OmIdr6hRFo9vk00V5/YjHObr08YR9C5oXi1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5e2154a209af468ad6d71186d94b1d5bc0e4a9627dcb86d44e7fef675586670","last_reissued_at":"2026-05-21T01:04:34.552383Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:34.552383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.20353","source_version":1,"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-21T01:04:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yGN1wB+Sf1yTB4K9TgIGDeRZyT4toJDz1n31Jec1mjrm+ZmCBWYnfIEPK8wgcWDW1e12pgOYJjW5733UAIyoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:47:24.759387Z"},"content_sha256":"d27fe2fcdfa404d3eb420136d0d1b5a3d862e653df734fffa167ca5c06560994","schema_version":"1.0","event_id":"sha256:d27fe2fcdfa404d3eb420136d0d1b5a3d862e653df734fffa167ca5c06560994"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4XRBKSRATL2GRLLNOEMG3FFR2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synchronous and Asynchronous Parallelism Approaches for Generalized Canonical Polyadic Tensor Decomposition with GenTen","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Eric T. Phipps, Jeremy M. Myers","submitted_at":"2026-05-19T18:06:47Z","abstract_excerpt":"The Canonical Polyadic (CP) tensor decomposition is a well-known method for interpretable analysis of high-dimensional data. Recently, the Generalized CP method (GCP) was introduced by Hong and Kolda to allow for flexible choice of the loss function in the optimization problem defining the CP model, enabling more interpretable decompositions of strongly non-Gaussian data such as count or binary data. Furthermore, Kolda and Hong introduced a version of GCP that leverages randomization and stochastic optimization to address scalability to large, sparse data sets. In this work, we take these idea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20353","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.20353/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-05-21T01:04:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IB34cfTOxQWbhzv1z1/HCnyTmYjVhnkCsRtjyN8sHfEsJgVsJG5X4zFp4SuMh2dp9ztvT/Kb1VU/vZrFpzScAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:47:24.759841Z"},"content_sha256":"3acb78309c8c770c1eaaed498a5287afdfe71b9742848bfd775030e54f347156","schema_version":"1.0","event_id":"sha256:3acb78309c8c770c1eaaed498a5287afdfe71b9742848bfd775030e54f347156"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4XRBKSRATL2GRLLNOEMG3FFR2W/bundle.json","state_url":"https://pith.science/pith/4XRBKSRATL2GRLLNOEMG3FFR2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4XRBKSRATL2GRLLNOEMG3FFR2W/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-05-21T18:47:24Z","links":{"resolver":"https://pith.science/pith/4XRBKSRATL2GRLLNOEMG3FFR2W","bundle":"https://pith.science/pith/4XRBKSRATL2GRLLNOEMG3FFR2W/bundle.json","state":"https://pith.science/pith/4XRBKSRATL2GRLLNOEMG3FFR2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4XRBKSRATL2GRLLNOEMG3FFR2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4XRBKSRATL2GRLLNOEMG3FFR2W","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":"aa3451e5fe4cca9b3234dfa98ef072aecea5dcf3e20cdbeea50059cbfe902541","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-19T18:06:47Z","title_canon_sha256":"b8e4184a6c02e85b60ab6fb83e5582f6ea075609d2a52bfa6885f5de8b259266"},"schema_version":"1.0","source":{"id":"2605.20353","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20353","created_at":"2026-05-21T01:04:34Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20353v1","created_at":"2026-05-21T01:04:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20353","created_at":"2026-05-21T01:04:34Z"},{"alias_kind":"pith_short_12","alias_value":"4XRBKSRATL2G","created_at":"2026-05-21T01:04:34Z"},{"alias_kind":"pith_short_16","alias_value":"4XRBKSRATL2GRLLN","created_at":"2026-05-21T01:04:34Z"},{"alias_kind":"pith_short_8","alias_value":"4XRBKSRA","created_at":"2026-05-21T01:04:34Z"}],"graph_snapshots":[{"event_id":"sha256:3acb78309c8c770c1eaaed498a5287afdfe71b9742848bfd775030e54f347156","target":"graph","created_at":"2026-05-21T01:04:34Z","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/2605.20353/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Canonical Polyadic (CP) tensor decomposition is a well-known method for interpretable analysis of high-dimensional data. Recently, the Generalized CP method (GCP) was introduced by Hong and Kolda to allow for flexible choice of the loss function in the optimization problem defining the CP model, enabling more interpretable decompositions of strongly non-Gaussian data such as count or binary data. Furthermore, Kolda and Hong introduced a version of GCP that leverages randomization and stochastic optimization to address scalability to large, sparse data sets. In this work, we take these idea","authors_text":"Eric T. Phipps, Jeremy M. Myers","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-19T18:06:47Z","title":"Synchronous and Asynchronous Parallelism Approaches for Generalized Canonical Polyadic Tensor Decomposition with GenTen"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20353","kind":"arxiv","version":1},"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:d27fe2fcdfa404d3eb420136d0d1b5a3d862e653df734fffa167ca5c06560994","target":"record","created_at":"2026-05-21T01:04:34Z","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":"aa3451e5fe4cca9b3234dfa98ef072aecea5dcf3e20cdbeea50059cbfe902541","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-19T18:06:47Z","title_canon_sha256":"b8e4184a6c02e85b60ab6fb83e5582f6ea075609d2a52bfa6885f5de8b259266"},"schema_version":"1.0","source":{"id":"2605.20353","kind":"arxiv","version":1}},"canonical_sha256":"e5e2154a209af468ad6d71186d94b1d5bc0e4a9627dcb86d44e7fef675586670","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5e2154a209af468ad6d71186d94b1d5bc0e4a9627dcb86d44e7fef675586670","first_computed_at":"2026-05-21T01:04:34.552383Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:34.552383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qC8J0mnSziyTEZUcZuU/eN9E7HcxVHm17O9p7LotEKba/HpB8OmIdr6hRFo9vk00V5/YjHObr08YR9C5oXi1AQ==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:34.553024Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.20353","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d27fe2fcdfa404d3eb420136d0d1b5a3d862e653df734fffa167ca5c06560994","sha256:3acb78309c8c770c1eaaed498a5287afdfe71b9742848bfd775030e54f347156"],"state_sha256":"292ae2a6933cdf976f95b4cad3d8ae2eaa39ee873866395ed21ae66abecb829b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lVNdxnFKd7sqrA0HgnpRMZ5Bo6ZaaBmPoRB6Ji6G2XEYTNqEBDbdY8gTHMmX0xlsh33LB2hfkFIpcDemV7rUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T18:47:24.763101Z","bundle_sha256":"e63467db37ce4733b06c8b9c2b12142e773ce938532fa9bbe1b968d1aef587d8"}}