{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:24VT7GR6PYKTTMTYPZEL3ILBRT","short_pith_number":"pith:24VT7GR6","schema_version":"1.0","canonical_sha256":"d72b3f9a3e7e1539b2787e48bda1618cd6ef9f75eedf6e996f310ea72c870fc3","source":{"kind":"arxiv","id":"2309.15032","version":2},"attestation_state":"computed","paper":{"title":"SOFARI: High-Dimensional Manifold-Based Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Jinchi Lv, Xin Zhou, Yingying Fan, Zemin Zheng","submitted_at":"2023-09-26T16:01:54Z","abstract_excerpt":"Multi-task learning is a widely used technique for harnessing information from various tasks. Recently, the sparse orthogonal factor regression (SOFAR) framework, based on the sparse singular value decomposition (SVD) within the coefficient matrix, was introduced for interpretable multi-task learning, enabling the discovery of meaningful latent feature-response association networks across different layers. However, conducting precise inference on the latent factor matrices has remained challenging due to the orthogonality constraints inherited from the sparse SVD constraints. In this paper, we"},"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":"2309.15032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2023-09-26T16:01:54Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"022424831d9d7a63d60444dd0657d2f4fc0fbe35f9ed6226a0056acbec6c1d80","abstract_canon_sha256":"bfab71b54e1ad94f7b6aed9e440ec24c396edaeb2ec103a17f742793827d7850"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:46.350060Z","signature_b64":"1VQYhh8IRS4dQ3vUH5sY1a+rgjqiUbNLU3Jc1/ViI8r19vzUWercvz6jFei7EOFDK9EleZerS1gA53KSuFGkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d72b3f9a3e7e1539b2787e48bda1618cd6ef9f75eedf6e996f310ea72c870fc3","last_reissued_at":"2026-07-05T11:29:46.349602Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:46.349602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SOFARI: High-Dimensional Manifold-Based Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Jinchi Lv, Xin Zhou, Yingying Fan, Zemin Zheng","submitted_at":"2023-09-26T16:01:54Z","abstract_excerpt":"Multi-task learning is a widely used technique for harnessing information from various tasks. Recently, the sparse orthogonal factor regression (SOFAR) framework, based on the sparse singular value decomposition (SVD) within the coefficient matrix, was introduced for interpretable multi-task learning, enabling the discovery of meaningful latent feature-response association networks across different layers. However, conducting precise inference on the latent factor matrices has remained challenging due to the orthogonality constraints inherited from the sparse SVD constraints. In this paper, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.15032","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/2309.15032/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":"2309.15032","created_at":"2026-07-05T11:29:46.349662+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.15032v2","created_at":"2026-07-05T11:29:46.349662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.15032","created_at":"2026-07-05T11:29:46.349662+00:00"},{"alias_kind":"pith_short_12","alias_value":"24VT7GR6PYKT","created_at":"2026-07-05T11:29:46.349662+00:00"},{"alias_kind":"pith_short_16","alias_value":"24VT7GR6PYKTTMTY","created_at":"2026-07-05T11:29:46.349662+00:00"},{"alias_kind":"pith_short_8","alias_value":"24VT7GR6","created_at":"2026-07-05T11:29:46.349662+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.02972","citing_title":"GeoERM: Geometry-Aware Multi-Task Representation Learning on Riemannian Manifolds","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/24VT7GR6PYKTTMTYPZEL3ILBRT","json":"https://pith.science/pith/24VT7GR6PYKTTMTYPZEL3ILBRT.json","graph_json":"https://pith.science/api/pith-number/24VT7GR6PYKTTMTYPZEL3ILBRT/graph.json","events_json":"https://pith.science/api/pith-number/24VT7GR6PYKTTMTYPZEL3ILBRT/events.json","paper":"https://pith.science/paper/24VT7GR6"},"agent_actions":{"view_html":"https://pith.science/pith/24VT7GR6PYKTTMTYPZEL3ILBRT","download_json":"https://pith.science/pith/24VT7GR6PYKTTMTYPZEL3ILBRT.json","view_paper":"https://pith.science/paper/24VT7GR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.15032&json=true","fetch_graph":"https://pith.science/api/pith-number/24VT7GR6PYKTTMTYPZEL3ILBRT/graph.json","fetch_events":"https://pith.science/api/pith-number/24VT7GR6PYKTTMTYPZEL3ILBRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/24VT7GR6PYKTTMTYPZEL3ILBRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/24VT7GR6PYKTTMTYPZEL3ILBRT/action/storage_attestation","attest_author":"https://pith.science/pith/24VT7GR6PYKTTMTYPZEL3ILBRT/action/author_attestation","sign_citation":"https://pith.science/pith/24VT7GR6PYKTTMTYPZEL3ILBRT/action/citation_signature","submit_replication":"https://pith.science/pith/24VT7GR6PYKTTMTYPZEL3ILBRT/action/replication_record"}},"created_at":"2026-07-05T11:29:46.349662+00:00","updated_at":"2026-07-05T11:29:46.349662+00:00"}