{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:5KYM2N7PDO4NZNGUOYGKR7BVVZ","short_pith_number":"pith:5KYM2N7P","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"},"canonical_sha256":"eab0cd37ef1bb8dcb4d4760ca8fc35ae71f1023edd737a6faaee6bdf94a8b55f","source":{"kind":"arxiv","id":"0710.4082","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.4082","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"0710.4082v3","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.4082","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"5KYM2N7PDO4N","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"5KYM2N7PDO4NZNGU","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"5KYM2N7P","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:5KYM2N7PDO4NZNGUOYGKR7BVVZ","target":"record","payload":{"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"},"canonical_sha256":"eab0cd37ef1bb8dcb4d4760ca8fc35ae71f1023edd737a6faaee6bdf94a8b55f","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"},"source_kind":"arxiv","source_id":"0710.4082","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJvz51/stRe6dtwnCCc41/1dVxKniLuN47eH9XkTNOYJsHotjymI33GFr/ntGs8eknymQKuh/3BXbeeHyDaTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:10:00.652470Z"},"content_sha256":"36dbfe5c351f3243c1c8fadcfc18776a6a968c13cf9554b25160cb2731835318","schema_version":"1.0","event_id":"sha256:36dbfe5c351f3243c1c8fadcfc18776a6a968c13cf9554b25160cb2731835318"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:5KYM2N7PDO4NZNGUOYGKR7BVVZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BEx8VdGgiVY+Qt7QMCburDNWjIl6GhI2IRea4PK4zPm6GamAZ/a0wpMvXgbiI5n2NR0hQieHZ1XjAzuCw0gkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:10:00.652852Z"},"content_sha256":"dd3f068d6fc31e84f09ad51c27457e9b804699d1e8ce7a481d1ef905a05e9a93","schema_version":"1.0","event_id":"sha256:dd3f068d6fc31e84f09ad51c27457e9b804699d1e8ce7a481d1ef905a05e9a93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5KYM2N7PDO4NZNGUOYGKR7BVVZ/bundle.json","state_url":"https://pith.science/pith/5KYM2N7PDO4NZNGUOYGKR7BVVZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5KYM2N7PDO4NZNGUOYGKR7BVVZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T09:10:00Z","links":{"resolver":"https://pith.science/pith/5KYM2N7PDO4NZNGUOYGKR7BVVZ","bundle":"https://pith.science/pith/5KYM2N7PDO4NZNGUOYGKR7BVVZ/bundle.json","state":"https://pith.science/pith/5KYM2N7PDO4NZNGUOYGKR7BVVZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5KYM2N7PDO4NZNGUOYGKR7BVVZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:5KYM2N7PDO4NZNGUOYGKR7BVVZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bcce5bc266a42181c100983df911acd12eb5848c5fd32afbd1760e5e13acdd48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2007-10-22T15:47:33Z","title_canon_sha256":"79e05aaf953638136b235bc8c5e9b0ff00e7b5cd351b51cefac52f8356021d7e"},"schema_version":"1.0","source":{"id":"0710.4082","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.4082","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"0710.4082v3","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.4082","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"5KYM2N7PDO4N","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"5KYM2N7PDO4NZNGU","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"5KYM2N7P","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:dd3f068d6fc31e84f09ad51c27457e9b804699d1e8ce7a481d1ef905a05e9a93","target":"graph","created_at":"2026-05-18T03:37:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Ignace Loris","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2007-10-22T15:47:33Z","title":"On the performance of algorithms for the minimization of $\\ell_1$-penalized functionals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.4082","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:36dbfe5c351f3243c1c8fadcfc18776a6a968c13cf9554b25160cb2731835318","target":"record","created_at":"2026-05-18T03:37:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bcce5bc266a42181c100983df911acd12eb5848c5fd32afbd1760e5e13acdd48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2007-10-22T15:47:33Z","title_canon_sha256":"79e05aaf953638136b235bc8c5e9b0ff00e7b5cd351b51cefac52f8356021d7e"},"schema_version":"1.0","source":{"id":"0710.4082","kind":"arxiv","version":3}},"canonical_sha256":"eab0cd37ef1bb8dcb4d4760ca8fc35ae71f1023edd737a6faaee6bdf94a8b55f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eab0cd37ef1bb8dcb4d4760ca8fc35ae71f1023edd737a6faaee6bdf94a8b55f","first_computed_at":"2026-05-18T03:37:42.178336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:42.178336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o95FEC4xEoVhkgEt9RkDRRb3a9qlbyvrCTC33KG9KkSHxsnRAcJA63z9VKH+kFQ+3huAGzN6KkBGJLyGcOqeDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:42.178948Z","signed_message":"canonical_sha256_bytes"},"source_id":"0710.4082","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36dbfe5c351f3243c1c8fadcfc18776a6a968c13cf9554b25160cb2731835318","sha256:dd3f068d6fc31e84f09ad51c27457e9b804699d1e8ce7a481d1ef905a05e9a93"],"state_sha256":"55e68b2181bc71b61de6ca3d3444b9f8d7e9aea643b4ee41343b4d07c4747e6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C6/ujdUiaS1HmvN5iBzQRg2v+wxMtbsqpS/qR1Wcq5CxvGKtLhsSoeWetHN/kMKHHbEmJXvC1lBUBujTGezLBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:10:00.655143Z","bundle_sha256":"82771671183a907ce7403218b41f70bb76878527874b78543993af448ba5bfb4"}}