{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GMB7HG7QSC64MUKBQIDFCWDNHC","short_pith_number":"pith:GMB7HG7Q","schema_version":"1.0","canonical_sha256":"3303f39bf090bdc65141820651586d38a26b724da0648804ebe65c7db7539d50","source":{"kind":"arxiv","id":"1512.05010","version":2},"attestation_state":"computed","paper":{"title":"Multiple penalized principal curves: analysis and computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"math.AP","authors_text":"Dejan Slep\\v{c}ev, Slav Kirov","submitted_at":"2015-12-15T23:26:50Z","abstract_excerpt":"We study the problem of finding the one-dimensional structure in a given data set. In other words we consider ways to approximate a given measure (data) by curves. We consider an objective functional whose minimizers are a regularization of principal curves and introduce a new functional which allows for multiple curves. We prove the existence of minimizers and establish their basic properties. We develop an efficient algorithm for obtaining (near) minimizers of the functional. While both of the functionals used are nonconvex, we argue that enlarging the configuration space to allow for multip"},"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":"1512.05010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2015-12-15T23:26:50Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"d49e298ea52bd2a121a90b09eedc57b5c53e08f46f0c274d622dd2af87ee71a6","abstract_canon_sha256":"f9a35c262fbc363151935c853976c987ef8d04da931881335e1ade6114289ec2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:20.938780Z","signature_b64":"8IwmS62WVgD3pfmSlMmgvzsHe773PV1jzY98ZH5G/XatwO6/8WAQR+f4JAJsssE3+yfDj1N1gX0uE383dHXxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3303f39bf090bdc65141820651586d38a26b724da0648804ebe65c7db7539d50","last_reissued_at":"2026-05-18T01:07:20.938383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:20.938383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple penalized principal curves: analysis and computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"math.AP","authors_text":"Dejan Slep\\v{c}ev, Slav Kirov","submitted_at":"2015-12-15T23:26:50Z","abstract_excerpt":"We study the problem of finding the one-dimensional structure in a given data set. In other words we consider ways to approximate a given measure (data) by curves. We consider an objective functional whose minimizers are a regularization of principal curves and introduce a new functional which allows for multiple curves. We prove the existence of minimizers and establish their basic properties. We develop an efficient algorithm for obtaining (near) minimizers of the functional. While both of the functionals used are nonconvex, we argue that enlarging the configuration space to allow for multip"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05010","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":""},"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":"1512.05010","created_at":"2026-05-18T01:07:20.938447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.05010v2","created_at":"2026-05-18T01:07:20.938447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05010","created_at":"2026-05-18T01:07:20.938447+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMB7HG7QSC64","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMB7HG7QSC64MUKB","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMB7HG7Q","created_at":"2026-05-18T12:29:22.688609+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/GMB7HG7QSC64MUKBQIDFCWDNHC","json":"https://pith.science/pith/GMB7HG7QSC64MUKBQIDFCWDNHC.json","graph_json":"https://pith.science/api/pith-number/GMB7HG7QSC64MUKBQIDFCWDNHC/graph.json","events_json":"https://pith.science/api/pith-number/GMB7HG7QSC64MUKBQIDFCWDNHC/events.json","paper":"https://pith.science/paper/GMB7HG7Q"},"agent_actions":{"view_html":"https://pith.science/pith/GMB7HG7QSC64MUKBQIDFCWDNHC","download_json":"https://pith.science/pith/GMB7HG7QSC64MUKBQIDFCWDNHC.json","view_paper":"https://pith.science/paper/GMB7HG7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.05010&json=true","fetch_graph":"https://pith.science/api/pith-number/GMB7HG7QSC64MUKBQIDFCWDNHC/graph.json","fetch_events":"https://pith.science/api/pith-number/GMB7HG7QSC64MUKBQIDFCWDNHC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMB7HG7QSC64MUKBQIDFCWDNHC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMB7HG7QSC64MUKBQIDFCWDNHC/action/storage_attestation","attest_author":"https://pith.science/pith/GMB7HG7QSC64MUKBQIDFCWDNHC/action/author_attestation","sign_citation":"https://pith.science/pith/GMB7HG7QSC64MUKBQIDFCWDNHC/action/citation_signature","submit_replication":"https://pith.science/pith/GMB7HG7QSC64MUKBQIDFCWDNHC/action/replication_record"}},"created_at":"2026-05-18T01:07:20.938447+00:00","updated_at":"2026-05-18T01:07:20.938447+00:00"}