{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:UTSJ6A7VECMSXAPL22SRYZ5XWX","short_pith_number":"pith:UTSJ6A7V","schema_version":"1.0","canonical_sha256":"a4e49f03f520992b81ebd6a51c67b7b5f06475c9fc7d74887630f1e2825736a4","source":{"kind":"arxiv","id":"0709.2556","version":1},"attestation_state":"computed","paper":{"title":"SDLS: a Matlab package for solving conic least-squares problems","license":"","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"CVUT), Didier Henrion (LAAS, Jerome Malick (LJK)","submitted_at":"2007-09-17T09:10:50Z","abstract_excerpt":"This document is an introduction to the Matlab package SDLS (Semi-Definite Least-Squares) for solving least-squares problems over convex symmetric cones. The package is shortly presented through the addressed problem, a sketch of the implemented algorithm, the syntax and calling sequences, a simple numerical example and some more advanced features. The implemented method consists in solving the dual problem with a quasi-Newton algorithm. We note that SDLS is not the most competitive implementation of this algorithm: efficient, robust, commercial implementations are available (contact the autho"},"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":"0709.2556","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2007-09-17T09:10:50Z","cross_cats_sorted":[],"title_canon_sha256":"eeccb19239b64d86a0beaf88821318797989c032693b8e4a924adfdaaecbd9fb","abstract_canon_sha256":"53b14c50df22fba4c7c2df596c380505bcae80b60441a59acb86016097d6e8bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:04:18.637906Z","signature_b64":"9tgUTDB+FXExhznJyCbQo3W1pv+gEzN6KJD2DK6rW/z2zdQ1PnE7/hGqjKcxWfjCSoDmWQ98lgTWADe0WvRFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4e49f03f520992b81ebd6a51c67b7b5f06475c9fc7d74887630f1e2825736a4","last_reissued_at":"2026-07-04T15:04:18.637399Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:04:18.637399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SDLS: a Matlab package for solving conic least-squares problems","license":"","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"CVUT), Didier Henrion (LAAS, Jerome Malick (LJK)","submitted_at":"2007-09-17T09:10:50Z","abstract_excerpt":"This document is an introduction to the Matlab package SDLS (Semi-Definite Least-Squares) for solving least-squares problems over convex symmetric cones. The package is shortly presented through the addressed problem, a sketch of the implemented algorithm, the syntax and calling sequences, a simple numerical example and some more advanced features. The implemented method consists in solving the dual problem with a quasi-Newton algorithm. We note that SDLS is not the most competitive implementation of this algorithm: efficient, robust, commercial implementations are available (contact the autho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.2556","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/0709.2556/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":"0709.2556","created_at":"2026-07-04T15:04:18.637469+00:00"},{"alias_kind":"arxiv_version","alias_value":"0709.2556v1","created_at":"2026-07-04T15:04:18.637469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.2556","created_at":"2026-07-04T15:04:18.637469+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTSJ6A7VECMS","created_at":"2026-07-04T15:04:18.637469+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTSJ6A7VECMSXAPL","created_at":"2026-07-04T15:04:18.637469+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTSJ6A7V","created_at":"2026-07-04T15:04:18.637469+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/UTSJ6A7VECMSXAPL22SRYZ5XWX","json":"https://pith.science/pith/UTSJ6A7VECMSXAPL22SRYZ5XWX.json","graph_json":"https://pith.science/api/pith-number/UTSJ6A7VECMSXAPL22SRYZ5XWX/graph.json","events_json":"https://pith.science/api/pith-number/UTSJ6A7VECMSXAPL22SRYZ5XWX/events.json","paper":"https://pith.science/paper/UTSJ6A7V"},"agent_actions":{"view_html":"https://pith.science/pith/UTSJ6A7VECMSXAPL22SRYZ5XWX","download_json":"https://pith.science/pith/UTSJ6A7VECMSXAPL22SRYZ5XWX.json","view_paper":"https://pith.science/paper/UTSJ6A7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0709.2556&json=true","fetch_graph":"https://pith.science/api/pith-number/UTSJ6A7VECMSXAPL22SRYZ5XWX/graph.json","fetch_events":"https://pith.science/api/pith-number/UTSJ6A7VECMSXAPL22SRYZ5XWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTSJ6A7VECMSXAPL22SRYZ5XWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTSJ6A7VECMSXAPL22SRYZ5XWX/action/storage_attestation","attest_author":"https://pith.science/pith/UTSJ6A7VECMSXAPL22SRYZ5XWX/action/author_attestation","sign_citation":"https://pith.science/pith/UTSJ6A7VECMSXAPL22SRYZ5XWX/action/citation_signature","submit_replication":"https://pith.science/pith/UTSJ6A7VECMSXAPL22SRYZ5XWX/action/replication_record"}},"created_at":"2026-07-04T15:04:18.637469+00:00","updated_at":"2026-07-04T15:04:18.637469+00:00"}