{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:5KYM2N7PDO4NZNGUOYGKR7BVVZ","short_pith_number":"pith:5KYM2N7P","schema_version":"1.0","canonical_sha256":"eab0cd37ef1bb8dcb4d4760ca8fc35ae71f1023edd737a6faaee6bdf94a8b55f","source":{"kind":"arxiv","id":"0710.4082","version":3},"attestation_state":"computed","paper":{"title":"On the performance of algorithms for the minimization of $\\ell_1$-penalized functionals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ignace Loris","submitted_at":"2007-10-22T15:47:33Z","abstract_excerpt":"The problem of assessing the performance of algorithms used for the minimization of an $\\ell_1$-penalized least-squares functional, for a range of penalty parameters, is investigated. A criterion that uses the idea of `approximation isochrones' is introduced. Five different iterative minimization algorithms are tested and compared, as well as two warm-start strategies. Both well-conditioned and ill-conditioned problems are used in the comparison, and the contrast between these two categories is highlighted."},"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":"0710.4082","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2007-10-22T15:47:33Z","cross_cats_sorted":[],"title_canon_sha256":"79e05aaf953638136b235bc8c5e9b0ff00e7b5cd351b51cefac52f8356021d7e","abstract_canon_sha256":"bcce5bc266a42181c100983df911acd12eb5848c5fd32afbd1760e5e13acdd48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:42.178948Z","signature_b64":"o95FEC4xEoVhkgEt9RkDRRb3a9qlbyvrCTC33KG9KkSHxsnRAcJA63z9VKH+kFQ+3huAGzN6KkBGJLyGcOqeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eab0cd37ef1bb8dcb4d4760ca8fc35ae71f1023edd737a6faaee6bdf94a8b55f","last_reissued_at":"2026-05-18T03:37:42.178336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:42.178336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the performance of algorithms for the minimization of $\\ell_1$-penalized functionals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ignace Loris","submitted_at":"2007-10-22T15:47:33Z","abstract_excerpt":"The problem of assessing the performance of algorithms used for the minimization of an $\\ell_1$-penalized least-squares functional, for a range of penalty parameters, is investigated. A criterion that uses the idea of `approximation isochrones' is introduced. Five different iterative minimization algorithms are tested and compared, as well as two warm-start strategies. Both well-conditioned and ill-conditioned problems are used in the comparison, and the contrast between these two categories is highlighted."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.4082","kind":"arxiv","version":3},"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":"0710.4082","created_at":"2026-05-18T03:37:42.178448+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.4082v3","created_at":"2026-05-18T03:37:42.178448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.4082","created_at":"2026-05-18T03:37:42.178448+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KYM2N7PDO4N","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KYM2N7PDO4NZNGU","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KYM2N7P","created_at":"2026-05-18T12:25:55.427421+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/5KYM2N7PDO4NZNGUOYGKR7BVVZ","json":"https://pith.science/pith/5KYM2N7PDO4NZNGUOYGKR7BVVZ.json","graph_json":"https://pith.science/api/pith-number/5KYM2N7PDO4NZNGUOYGKR7BVVZ/graph.json","events_json":"https://pith.science/api/pith-number/5KYM2N7PDO4NZNGUOYGKR7BVVZ/events.json","paper":"https://pith.science/paper/5KYM2N7P"},"agent_actions":{"view_html":"https://pith.science/pith/5KYM2N7PDO4NZNGUOYGKR7BVVZ","download_json":"https://pith.science/pith/5KYM2N7PDO4NZNGUOYGKR7BVVZ.json","view_paper":"https://pith.science/paper/5KYM2N7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.4082&json=true","fetch_graph":"https://pith.science/api/pith-number/5KYM2N7PDO4NZNGUOYGKR7BVVZ/graph.json","fetch_events":"https://pith.science/api/pith-number/5KYM2N7PDO4NZNGUOYGKR7BVVZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KYM2N7PDO4NZNGUOYGKR7BVVZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KYM2N7PDO4NZNGUOYGKR7BVVZ/action/storage_attestation","attest_author":"https://pith.science/pith/5KYM2N7PDO4NZNGUOYGKR7BVVZ/action/author_attestation","sign_citation":"https://pith.science/pith/5KYM2N7PDO4NZNGUOYGKR7BVVZ/action/citation_signature","submit_replication":"https://pith.science/pith/5KYM2N7PDO4NZNGUOYGKR7BVVZ/action/replication_record"}},"created_at":"2026-05-18T03:37:42.178448+00:00","updated_at":"2026-05-18T03:37:42.178448+00:00"}