{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AVRGYLVMT52TYJ6EVCOCV7DPEF","short_pith_number":"pith:AVRGYLVM","schema_version":"1.0","canonical_sha256":"05626c2eac9f753c27c4a89c2afc6f2167768214d8298554d698f6637dba4f55","source":{"kind":"arxiv","id":"2412.06233","version":1},"attestation_state":"computed","paper":{"title":"Representational Transfer Learning for Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Dong Liu, Jiahui Xie, Kangxiang Qin, Yong He, Zeyu Li","submitted_at":"2024-12-09T06:14:47Z","abstract_excerpt":"We propose to transfer representational knowledge from multiple sources to a target noisy matrix completion task by aggregating singular subspaces information. Under our representational similarity framework, we first integrate linear representation information by solving a two-way principal component analysis problem based on a properly debiased matrix-valued dataset. After acquiring better column and row representation estimators from the sources, the original high-dimensional target matrix completion problem is then transformed into a low-dimensional linear regression, of which the statisti"},"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":"2412.06233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-12-09T06:14:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ab18fbe549ba52bed0d011a4ae395e29cc3b2acd560f764013b73f2d5d27c0ea","abstract_canon_sha256":"4e6edc568442a130278edb6546cfd170d732da82593dcab94ad518156d684b9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:46:17.575933Z","signature_b64":"bi9wu7MkDXCiOLH2zcPReBY5CCREQUvXe0CwAF7g6LIV7PxmJRPRYI4hN3kUOTJooOMm8xe590lfxwoLUuiaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05626c2eac9f753c27c4a89c2afc6f2167768214d8298554d698f6637dba4f55","last_reissued_at":"2026-07-05T09:46:17.575440Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:46:17.575440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representational Transfer Learning for Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Dong Liu, Jiahui Xie, Kangxiang Qin, Yong He, Zeyu Li","submitted_at":"2024-12-09T06:14:47Z","abstract_excerpt":"We propose to transfer representational knowledge from multiple sources to a target noisy matrix completion task by aggregating singular subspaces information. Under our representational similarity framework, we first integrate linear representation information by solving a two-way principal component analysis problem based on a properly debiased matrix-valued dataset. After acquiring better column and row representation estimators from the sources, the original high-dimensional target matrix completion problem is then transformed into a low-dimensional linear regression, of which the statisti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06233","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/2412.06233/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":"2412.06233","created_at":"2026-07-05T09:46:17.575498+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.06233v1","created_at":"2026-07-05T09:46:17.575498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06233","created_at":"2026-07-05T09:46:17.575498+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVRGYLVMT52T","created_at":"2026-07-05T09:46:17.575498+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVRGYLVMT52TYJ6E","created_at":"2026-07-05T09:46:17.575498+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVRGYLVM","created_at":"2026-07-05T09:46:17.575498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20161","citing_title":"SMART: A Spectral Transfer Approach to Multi-Task Learning","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19152","citing_title":"Transfer Learning for Degree-Corrected Mixed Membership Network Models","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AVRGYLVMT52TYJ6EVCOCV7DPEF","json":"https://pith.science/pith/AVRGYLVMT52TYJ6EVCOCV7DPEF.json","graph_json":"https://pith.science/api/pith-number/AVRGYLVMT52TYJ6EVCOCV7DPEF/graph.json","events_json":"https://pith.science/api/pith-number/AVRGYLVMT52TYJ6EVCOCV7DPEF/events.json","paper":"https://pith.science/paper/AVRGYLVM"},"agent_actions":{"view_html":"https://pith.science/pith/AVRGYLVMT52TYJ6EVCOCV7DPEF","download_json":"https://pith.science/pith/AVRGYLVMT52TYJ6EVCOCV7DPEF.json","view_paper":"https://pith.science/paper/AVRGYLVM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.06233&json=true","fetch_graph":"https://pith.science/api/pith-number/AVRGYLVMT52TYJ6EVCOCV7DPEF/graph.json","fetch_events":"https://pith.science/api/pith-number/AVRGYLVMT52TYJ6EVCOCV7DPEF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVRGYLVMT52TYJ6EVCOCV7DPEF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVRGYLVMT52TYJ6EVCOCV7DPEF/action/storage_attestation","attest_author":"https://pith.science/pith/AVRGYLVMT52TYJ6EVCOCV7DPEF/action/author_attestation","sign_citation":"https://pith.science/pith/AVRGYLVMT52TYJ6EVCOCV7DPEF/action/citation_signature","submit_replication":"https://pith.science/pith/AVRGYLVMT52TYJ6EVCOCV7DPEF/action/replication_record"}},"created_at":"2026-07-05T09:46:17.575498+00:00","updated_at":"2026-07-05T09:46:17.575498+00:00"}