{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WJITFGLPLERU6J7U74MGXNXUHQ","short_pith_number":"pith:WJITFGLP","schema_version":"1.0","canonical_sha256":"b25132996f59234f27f4ff186bb6f43c3066cb6ad0d03cd077a7d9848b979fc7","source":{"kind":"arxiv","id":"2305.17744","version":2},"attestation_state":"computed","paper":{"title":"Heterogeneous Matrix Factorization: When Features Differ by Datasets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Naichen Shi, Raed Al Kontar, Salar Fattahi","submitted_at":"2023-05-28T14:56:17Z","abstract_excerpt":"In myriad statistical applications, data are collected from related but heterogeneous sources. These sources share some commonalities while containing idiosyncratic characteristics. One of the most fundamental challenges in such scenarios is to recover the shared and source-specific factors. Despite the existence of a few heuristic approaches, a generic algorithm with theoretical guarantees has yet to be established. In this paper, we tackle the problem by proposing a method called Heterogeneous Matrix Factorization to separate the shared and unique factors for a class of problems. HMF maintai"},"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":"2305.17744","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-05-28T14:56:17Z","cross_cats_sorted":[],"title_canon_sha256":"f8a54b7746bfcae1f10fb242ae47bbb9963845b718bf91c1d3b1e83113efdd58","abstract_canon_sha256":"7d760e04bfc5c4080b3ed20d9468d30264285f7e4d7c9a4c1bbebf88951ec2ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:30.389592Z","signature_b64":"AmcyzY5U/N9pBqkTw1pfMCxtctohMURD9JFqBoZp+hCMMgJ4j8AY2W6YIOOkrhbp8OsZZoZVoTfiuzLkCPruCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b25132996f59234f27f4ff186bb6f43c3066cb6ad0d03cd077a7d9848b979fc7","last_reissued_at":"2026-07-05T08:01:30.389060Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:30.389060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heterogeneous Matrix Factorization: When Features Differ by Datasets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Naichen Shi, Raed Al Kontar, Salar Fattahi","submitted_at":"2023-05-28T14:56:17Z","abstract_excerpt":"In myriad statistical applications, data are collected from related but heterogeneous sources. These sources share some commonalities while containing idiosyncratic characteristics. One of the most fundamental challenges in such scenarios is to recover the shared and source-specific factors. Despite the existence of a few heuristic approaches, a generic algorithm with theoretical guarantees has yet to be established. In this paper, we tackle the problem by proposing a method called Heterogeneous Matrix Factorization to separate the shared and unique factors for a class of problems. HMF maintai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.17744","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/2305.17744/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":"2305.17744","created_at":"2026-07-05T08:01:30.389129+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.17744v2","created_at":"2026-07-05T08:01:30.389129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.17744","created_at":"2026-07-05T08:01:30.389129+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJITFGLPLERU","created_at":"2026-07-05T08:01:30.389129+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJITFGLPLERU6J7U","created_at":"2026-07-05T08:01:30.389129+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJITFGLP","created_at":"2026-07-05T08:01:30.389129+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.12252","citing_title":"A Collaborative Process Parameter Recommender System for Fleets of Networked Manufacturing Machines -- with Application to 3D Printing","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WJITFGLPLERU6J7U74MGXNXUHQ","json":"https://pith.science/pith/WJITFGLPLERU6J7U74MGXNXUHQ.json","graph_json":"https://pith.science/api/pith-number/WJITFGLPLERU6J7U74MGXNXUHQ/graph.json","events_json":"https://pith.science/api/pith-number/WJITFGLPLERU6J7U74MGXNXUHQ/events.json","paper":"https://pith.science/paper/WJITFGLP"},"agent_actions":{"view_html":"https://pith.science/pith/WJITFGLPLERU6J7U74MGXNXUHQ","download_json":"https://pith.science/pith/WJITFGLPLERU6J7U74MGXNXUHQ.json","view_paper":"https://pith.science/paper/WJITFGLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.17744&json=true","fetch_graph":"https://pith.science/api/pith-number/WJITFGLPLERU6J7U74MGXNXUHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WJITFGLPLERU6J7U74MGXNXUHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJITFGLPLERU6J7U74MGXNXUHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJITFGLPLERU6J7U74MGXNXUHQ/action/storage_attestation","attest_author":"https://pith.science/pith/WJITFGLPLERU6J7U74MGXNXUHQ/action/author_attestation","sign_citation":"https://pith.science/pith/WJITFGLPLERU6J7U74MGXNXUHQ/action/citation_signature","submit_replication":"https://pith.science/pith/WJITFGLPLERU6J7U74MGXNXUHQ/action/replication_record"}},"created_at":"2026-07-05T08:01:30.389129+00:00","updated_at":"2026-07-05T08:01:30.389129+00:00"}