{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4M3G2AIEXBLGU7ZV6VD4E5JSAG","short_pith_number":"pith:4M3G2AIE","schema_version":"1.0","canonical_sha256":"e3366d0104b8566a7f35f547c2753201badcecf026f7f3fab2eaedd578e9a590","source":{"kind":"arxiv","id":"1302.7043","version":1},"attestation_state":"computed","paper":{"title":"Scoup-SMT: Scalable Coupled Sparse Matrix-Tensor Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Brian Murphy, Christos Faloutsos, Evangelos E. Papalexakis, Nicholas D. Sidiropoulos, Partha Pratim Talukdar, Tom M. Mitchell","submitted_at":"2013-02-28T00:37:29Z","abstract_excerpt":"How can we correlate neural activity in the human brain as it responds to words, with behavioral data expressed as answers to questions about these same words? In short, we want to find latent variables, that explain both the brain activity, as well as the behavioral responses. We show that this is an instance of the Coupled Matrix-Tensor Factorization (CMTF) problem. We propose Scoup-SMT, a novel, fast, and parallel algorithm that solves the CMTF problem and produces a sparse latent low-rank subspace of the data. In our experiments, we find that Scoup-SMT is 50-100 times faster than a state-o"},"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":"1302.7043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-28T00:37:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3fa6f2011f3af3cd1bf3ce2678d62a016ed524423a19644856cecf11f1ae499f","abstract_canon_sha256":"36f4fa839694d4bd398693ca81f3cbc80992de13866fa0ea9270caaa7195ab51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:17.643756Z","signature_b64":"QeTkyrVp8/lzRBCFfvTs+m9p6xRH9+89hAV736fVQDzTxyK66JidKDqitEi5vBMuolXlqkCLa32cwNvdL+JKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3366d0104b8566a7f35f547c2753201badcecf026f7f3fab2eaedd578e9a590","last_reissued_at":"2026-05-18T03:32:17.643160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:17.643160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scoup-SMT: Scalable Coupled Sparse Matrix-Tensor Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Brian Murphy, Christos Faloutsos, Evangelos E. Papalexakis, Nicholas D. Sidiropoulos, Partha Pratim Talukdar, Tom M. Mitchell","submitted_at":"2013-02-28T00:37:29Z","abstract_excerpt":"How can we correlate neural activity in the human brain as it responds to words, with behavioral data expressed as answers to questions about these same words? In short, we want to find latent variables, that explain both the brain activity, as well as the behavioral responses. We show that this is an instance of the Coupled Matrix-Tensor Factorization (CMTF) problem. We propose Scoup-SMT, a novel, fast, and parallel algorithm that solves the CMTF problem and produces a sparse latent low-rank subspace of the data. In our experiments, we find that Scoup-SMT is 50-100 times faster than a state-o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.7043","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":""},"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":"1302.7043","created_at":"2026-05-18T03:32:17.643242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.7043v1","created_at":"2026-05-18T03:32:17.643242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.7043","created_at":"2026-05-18T03:32:17.643242+00:00"},{"alias_kind":"pith_short_12","alias_value":"4M3G2AIEXBLG","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4M3G2AIEXBLGU7ZV","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4M3G2AIE","created_at":"2026-05-18T12:27:34.582898+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/4M3G2AIEXBLGU7ZV6VD4E5JSAG","json":"https://pith.science/pith/4M3G2AIEXBLGU7ZV6VD4E5JSAG.json","graph_json":"https://pith.science/api/pith-number/4M3G2AIEXBLGU7ZV6VD4E5JSAG/graph.json","events_json":"https://pith.science/api/pith-number/4M3G2AIEXBLGU7ZV6VD4E5JSAG/events.json","paper":"https://pith.science/paper/4M3G2AIE"},"agent_actions":{"view_html":"https://pith.science/pith/4M3G2AIEXBLGU7ZV6VD4E5JSAG","download_json":"https://pith.science/pith/4M3G2AIEXBLGU7ZV6VD4E5JSAG.json","view_paper":"https://pith.science/paper/4M3G2AIE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.7043&json=true","fetch_graph":"https://pith.science/api/pith-number/4M3G2AIEXBLGU7ZV6VD4E5JSAG/graph.json","fetch_events":"https://pith.science/api/pith-number/4M3G2AIEXBLGU7ZV6VD4E5JSAG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4M3G2AIEXBLGU7ZV6VD4E5JSAG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4M3G2AIEXBLGU7ZV6VD4E5JSAG/action/storage_attestation","attest_author":"https://pith.science/pith/4M3G2AIEXBLGU7ZV6VD4E5JSAG/action/author_attestation","sign_citation":"https://pith.science/pith/4M3G2AIEXBLGU7ZV6VD4E5JSAG/action/citation_signature","submit_replication":"https://pith.science/pith/4M3G2AIEXBLGU7ZV6VD4E5JSAG/action/replication_record"}},"created_at":"2026-05-18T03:32:17.643242+00:00","updated_at":"2026-05-18T03:32:17.643242+00:00"}