{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:TYVAYYNRIDRGWMQ7K2V65P4WF4","short_pith_number":"pith:TYVAYYNR","schema_version":"1.0","canonical_sha256":"9e2a0c61b140e26b321f56abeebf962f39f5b2e8887913d2aa3fed3cd0fd87b2","source":{"kind":"arxiv","id":"0710.3728","version":4},"attestation_state":"computed","paper":{"title":"L1Packv2: A Mathematica package for minimizing an $\\ell_1$-penalized functional","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Ignace Loris","submitted_at":"2007-10-19T16:16:02Z","abstract_excerpt":"L1Packv2 is a Mathematica package that contains a number of algorithms that can be used for the minimization of an $\\ell_1$-penalized least squares functional. The algorithms can handle a mix of penalized and unpenalized variables. Several instructive examples are given. Also, an implementation that yields an exact output whenever exact data are given is provided."},"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.3728","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2007-10-19T16:16:02Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"b543822f2fe79b64f01b3e758e7ad7bc8a7cd9881eb975966ecf691ec0d76cdd","abstract_canon_sha256":"912a34abefb0e830536f4e647e72112da2c783f3c264f760f4bd27037104ff57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:02.872937Z","signature_b64":"nWFoXIT3SbYxK0Ax9J1orUWbiociP3Oei5Y5TvPZXmsbrzKL6szZB2f1duTO8LkKrdGbrtqUjb2xJMr6Q/aaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e2a0c61b140e26b321f56abeebf962f39f5b2e8887913d2aa3fed3cd0fd87b2","last_reissued_at":"2026-06-03T22:06:02.872530Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:02.872530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"L1Packv2: A Mathematica package for minimizing an $\\ell_1$-penalized functional","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Ignace Loris","submitted_at":"2007-10-19T16:16:02Z","abstract_excerpt":"L1Packv2 is a Mathematica package that contains a number of algorithms that can be used for the minimization of an $\\ell_1$-penalized least squares functional. The algorithms can handle a mix of penalized and unpenalized variables. Several instructive examples are given. Also, an implementation that yields an exact output whenever exact data are given is provided."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.3728","kind":"arxiv","version":4},"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/0710.3728/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":"0710.3728","created_at":"2026-06-03T22:06:02.872587+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.3728v4","created_at":"2026-06-03T22:06:02.872587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.3728","created_at":"2026-06-03T22:06:02.872587+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYVAYYNRIDRG","created_at":"2026-06-03T22:06:02.872587+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYVAYYNRIDRGWMQ7","created_at":"2026-06-03T22:06:02.872587+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYVAYYNR","created_at":"2026-06-03T22:06:02.872587+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/TYVAYYNRIDRGWMQ7K2V65P4WF4","json":"https://pith.science/pith/TYVAYYNRIDRGWMQ7K2V65P4WF4.json","graph_json":"https://pith.science/api/pith-number/TYVAYYNRIDRGWMQ7K2V65P4WF4/graph.json","events_json":"https://pith.science/api/pith-number/TYVAYYNRIDRGWMQ7K2V65P4WF4/events.json","paper":"https://pith.science/paper/TYVAYYNR"},"agent_actions":{"view_html":"https://pith.science/pith/TYVAYYNRIDRGWMQ7K2V65P4WF4","download_json":"https://pith.science/pith/TYVAYYNRIDRGWMQ7K2V65P4WF4.json","view_paper":"https://pith.science/paper/TYVAYYNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.3728&json=true","fetch_graph":"https://pith.science/api/pith-number/TYVAYYNRIDRGWMQ7K2V65P4WF4/graph.json","fetch_events":"https://pith.science/api/pith-number/TYVAYYNRIDRGWMQ7K2V65P4WF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYVAYYNRIDRGWMQ7K2V65P4WF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYVAYYNRIDRGWMQ7K2V65P4WF4/action/storage_attestation","attest_author":"https://pith.science/pith/TYVAYYNRIDRGWMQ7K2V65P4WF4/action/author_attestation","sign_citation":"https://pith.science/pith/TYVAYYNRIDRGWMQ7K2V65P4WF4/action/citation_signature","submit_replication":"https://pith.science/pith/TYVAYYNRIDRGWMQ7K2V65P4WF4/action/replication_record"}},"created_at":"2026-06-03T22:06:02.872587+00:00","updated_at":"2026-06-03T22:06:02.872587+00:00"}