{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ERXALBJGTITZTJMUW3BPO4QSQE","short_pith_number":"pith:ERXALBJG","schema_version":"1.0","canonical_sha256":"246e0585269a2799a594b6c2f77212813bb9ecc26a1d8ff8a5c3a6f637fa2d11","source":{"kind":"arxiv","id":"2404.10444","version":1},"attestation_state":"computed","paper":{"title":"Semi-supervised Fr\\'echet Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Rui Qiu, Zhenhua Lin, Zhou Yu","submitted_at":"2024-04-16T10:30:52Z","abstract_excerpt":"This paper explores the field of semi-supervised Fr\\'echet regression, driven by the significant costs associated with obtaining non-Euclidean labels. Methodologically, we propose two novel methods: semi-supervised NW Fr\\'echet regression and semi-supervised kNN Fr\\'echet regression, both based on graph distance acquired from all feature instances. These methods extend the scope of existing semi-supervised Euclidean regression methods. We establish their convergence rates with limited labeled data and large amounts of unlabeled data, taking into account the low-dimensional manifold structure 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":"2404.10444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-04-16T10:30:52Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"d94058c0640d50fc3f80b7d7ec417578d4c030ec085f8363e31c9f3ed8c8c809","abstract_canon_sha256":"31bcacca0cee601c30214ccee525555aca94ecf0ef8e9e861108c6c4937c2b36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:08:30.585046Z","signature_b64":"ogXTnZEvdKj18saUkqMKZmiG9m/89ffimISlawONImXI/R3RDKJt+CeAnUCSLHvA8jARXjU0UW7Gyxf7k2CuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"246e0585269a2799a594b6c2f77212813bb9ecc26a1d8ff8a5c3a6f637fa2d11","last_reissued_at":"2026-07-05T08:08:30.584617Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:08:30.584617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-supervised Fr\\'echet Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Rui Qiu, Zhenhua Lin, Zhou Yu","submitted_at":"2024-04-16T10:30:52Z","abstract_excerpt":"This paper explores the field of semi-supervised Fr\\'echet regression, driven by the significant costs associated with obtaining non-Euclidean labels. Methodologically, we propose two novel methods: semi-supervised NW Fr\\'echet regression and semi-supervised kNN Fr\\'echet regression, both based on graph distance acquired from all feature instances. These methods extend the scope of existing semi-supervised Euclidean regression methods. We establish their convergence rates with limited labeled data and large amounts of unlabeled data, taking into account the low-dimensional manifold structure o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.10444","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/2404.10444/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":"2404.10444","created_at":"2026-07-05T08:08:30.584676+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.10444v1","created_at":"2026-07-05T08:08:30.584676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.10444","created_at":"2026-07-05T08:08:30.584676+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERXALBJGTITZ","created_at":"2026-07-05T08:08:30.584676+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERXALBJGTITZTJMU","created_at":"2026-07-05T08:08:30.584676+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERXALBJG","created_at":"2026-07-05T08:08:30.584676+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07947","citing_title":"Bayesian Global Fr\\'echet Regression via Weak Conditional Expectations","ref_index":103,"is_internal_anchor":false},{"citing_arxiv_id":"2410.23212","citing_title":"Improved convergence rate of kNN graph Laplacians: differentiable self-tuned affinity","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02693","citing_title":"Random-Effects Algorithm for Random Objects in Metric Spaces","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ERXALBJGTITZTJMUW3BPO4QSQE","json":"https://pith.science/pith/ERXALBJGTITZTJMUW3BPO4QSQE.json","graph_json":"https://pith.science/api/pith-number/ERXALBJGTITZTJMUW3BPO4QSQE/graph.json","events_json":"https://pith.science/api/pith-number/ERXALBJGTITZTJMUW3BPO4QSQE/events.json","paper":"https://pith.science/paper/ERXALBJG"},"agent_actions":{"view_html":"https://pith.science/pith/ERXALBJGTITZTJMUW3BPO4QSQE","download_json":"https://pith.science/pith/ERXALBJGTITZTJMUW3BPO4QSQE.json","view_paper":"https://pith.science/paper/ERXALBJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.10444&json=true","fetch_graph":"https://pith.science/api/pith-number/ERXALBJGTITZTJMUW3BPO4QSQE/graph.json","fetch_events":"https://pith.science/api/pith-number/ERXALBJGTITZTJMUW3BPO4QSQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERXALBJGTITZTJMUW3BPO4QSQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERXALBJGTITZTJMUW3BPO4QSQE/action/storage_attestation","attest_author":"https://pith.science/pith/ERXALBJGTITZTJMUW3BPO4QSQE/action/author_attestation","sign_citation":"https://pith.science/pith/ERXALBJGTITZTJMUW3BPO4QSQE/action/citation_signature","submit_replication":"https://pith.science/pith/ERXALBJGTITZTJMUW3BPO4QSQE/action/replication_record"}},"created_at":"2026-07-05T08:08:30.584676+00:00","updated_at":"2026-07-05T08:08:30.584676+00:00"}