{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NREQYBNLD23JBG3HHY6WEJPCB4","short_pith_number":"pith:NREQYBNL","canonical_record":{"source":{"id":"1708.08640","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-08-29T08:38:06Z","cross_cats_sorted":[],"title_canon_sha256":"13ebdc8aafef89a455c932430b134e2663a31bb3428f912c54b1cdde62bd6763","abstract_canon_sha256":"2a156c5bfd8353f3963c9bcdf394d806ec1b3a00810a9f3365bd8be5d1b4275d"},"schema_version":"1.0"},"canonical_sha256":"6c490c05ab1eb6909b673e3d6225e20f197ba222884207c2be7f3c5e534c4eb4","source":{"kind":"arxiv","id":"1708.08640","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08640","created_at":"2026-05-18T00:28:52Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08640v6","created_at":"2026-05-18T00:28:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08640","created_at":"2026-05-18T00:28:52Z"},{"alias_kind":"pith_short_12","alias_value":"NREQYBNLD23J","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NREQYBNLD23JBG3H","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NREQYBNL","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NREQYBNLD23JBG3HHY6WEJPCB4","target":"record","payload":{"canonical_record":{"source":{"id":"1708.08640","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-08-29T08:38:06Z","cross_cats_sorted":[],"title_canon_sha256":"13ebdc8aafef89a455c932430b134e2663a31bb3428f912c54b1cdde62bd6763","abstract_canon_sha256":"2a156c5bfd8353f3963c9bcdf394d806ec1b3a00810a9f3365bd8be5d1b4275d"},"schema_version":"1.0"},"canonical_sha256":"6c490c05ab1eb6909b673e3d6225e20f197ba222884207c2be7f3c5e534c4eb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:52.933969Z","signature_b64":"fdin+PfLg43RBwOb9c84JGmAle6Nxe2sULCCUqADm/ovKnlUNXIue+ZuaaqR5GHuSPWxUUVmWgem1JDhsWdsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c490c05ab1eb6909b673e3d6225e20f197ba222884207c2be7f3c5e534c4eb4","last_reissued_at":"2026-05-18T00:28:52.933546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:52.933546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.08640","source_version":6,"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-18T00:28:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFUActmjNB2nMYrXVA/VGtiJYnvhvcunYobkNIPyh2bhB26L0VN/f0tTjGiiIk3cnPc8iPIp7EE6MLAtba0PDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T06:49:42.978664Z"},"content_sha256":"904f9bd565b0b40f2aab5f7cd280cb0b5b1ad0b7b99dde6da046defc282bbdde","schema_version":"1.0","event_id":"sha256:904f9bd565b0b40f2aab5f7cd280cb0b5b1ad0b7b99dde6da046defc282bbdde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NREQYBNLD23JBG3HHY6WEJPCB4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast, Accurate, and Scalable Method for Sparse Coupled Matrix-Tensor Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Dongjin Choi, Jun-Gi Jang, U Kang","submitted_at":"2017-08-29T08:38:06Z","abstract_excerpt":"How can we capture the hidden properties from a tensor and a matrix data simultaneously in a fast, accurate, and scalable way? Coupled matrix-tensor factorization (CMTF) is a major tool to extract latent factors from a tensor and matrices at once. Designing an accurate and efficient CMTF method has become more crucial as the size and dimension of real-world data are growing explosively. However, existing methods for CMTF suffer from lack of accuracy, slow running time, and limited scalability. In this paper, we propose S3CMTF, a fast, accurate, and scalable CMTF method. S3CMTF achieves high sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08640","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"},"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-18T00:28:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OEOXHZAaVLugzxbbXspm5z5DLCQwgOUgJ+bekQBTuSWR7vDk8P4biuz3D4r7o6AYoWNKV/2NVIjjusjPRSHZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T06:49:42.979012Z"},"content_sha256":"66315104332e86e02c723d10ba7f0de7ab67f695573301b995a47bef06911044","schema_version":"1.0","event_id":"sha256:66315104332e86e02c723d10ba7f0de7ab67f695573301b995a47bef06911044"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NREQYBNLD23JBG3HHY6WEJPCB4/bundle.json","state_url":"https://pith.science/pith/NREQYBNLD23JBG3HHY6WEJPCB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NREQYBNLD23JBG3HHY6WEJPCB4/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-07-02T06:49:42Z","links":{"resolver":"https://pith.science/pith/NREQYBNLD23JBG3HHY6WEJPCB4","bundle":"https://pith.science/pith/NREQYBNLD23JBG3HHY6WEJPCB4/bundle.json","state":"https://pith.science/pith/NREQYBNLD23JBG3HHY6WEJPCB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NREQYBNLD23JBG3HHY6WEJPCB4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NREQYBNLD23JBG3HHY6WEJPCB4","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":"2a156c5bfd8353f3963c9bcdf394d806ec1b3a00810a9f3365bd8be5d1b4275d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-08-29T08:38:06Z","title_canon_sha256":"13ebdc8aafef89a455c932430b134e2663a31bb3428f912c54b1cdde62bd6763"},"schema_version":"1.0","source":{"id":"1708.08640","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08640","created_at":"2026-05-18T00:28:52Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08640v6","created_at":"2026-05-18T00:28:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08640","created_at":"2026-05-18T00:28:52Z"},{"alias_kind":"pith_short_12","alias_value":"NREQYBNLD23J","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NREQYBNLD23JBG3H","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NREQYBNL","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:66315104332e86e02c723d10ba7f0de7ab67f695573301b995a47bef06911044","target":"graph","created_at":"2026-05-18T00:28:52Z","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"},"paper":{"abstract_excerpt":"How can we capture the hidden properties from a tensor and a matrix data simultaneously in a fast, accurate, and scalable way? Coupled matrix-tensor factorization (CMTF) is a major tool to extract latent factors from a tensor and matrices at once. Designing an accurate and efficient CMTF method has become more crucial as the size and dimension of real-world data are growing explosively. However, existing methods for CMTF suffer from lack of accuracy, slow running time, and limited scalability. In this paper, we propose S3CMTF, a fast, accurate, and scalable CMTF method. S3CMTF achieves high sp","authors_text":"Dongjin Choi, Jun-Gi Jang, U Kang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-08-29T08:38:06Z","title":"Fast, Accurate, and Scalable Method for Sparse Coupled Matrix-Tensor Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08640","kind":"arxiv","version":6},"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:904f9bd565b0b40f2aab5f7cd280cb0b5b1ad0b7b99dde6da046defc282bbdde","target":"record","created_at":"2026-05-18T00:28:52Z","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":"2a156c5bfd8353f3963c9bcdf394d806ec1b3a00810a9f3365bd8be5d1b4275d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-08-29T08:38:06Z","title_canon_sha256":"13ebdc8aafef89a455c932430b134e2663a31bb3428f912c54b1cdde62bd6763"},"schema_version":"1.0","source":{"id":"1708.08640","kind":"arxiv","version":6}},"canonical_sha256":"6c490c05ab1eb6909b673e3d6225e20f197ba222884207c2be7f3c5e534c4eb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c490c05ab1eb6909b673e3d6225e20f197ba222884207c2be7f3c5e534c4eb4","first_computed_at":"2026-05-18T00:28:52.933546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:52.933546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fdin+PfLg43RBwOb9c84JGmAle6Nxe2sULCCUqADm/ovKnlUNXIue+ZuaaqR5GHuSPWxUUVmWgem1JDhsWdsAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:52.933969Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.08640","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:904f9bd565b0b40f2aab5f7cd280cb0b5b1ad0b7b99dde6da046defc282bbdde","sha256:66315104332e86e02c723d10ba7f0de7ab67f695573301b995a47bef06911044"],"state_sha256":"dbd735cd4fbcbce436b71a3761d26215ee4731b4cfdf812fbe57cc2e94a6f7c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+NgmVKmTdOcJXzc/U+NazYJrOehRJJRdSJkOuBxsaVEtx5QMyb39haasBmOWvaHPztwjT2SGfCm/EaKg5AwAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T06:49:42.980975Z","bundle_sha256":"d21d987c7131430686fb3d6a8577bb18906aee246506e8326ca25c3cf31462d9"}}