{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:27FUB4ST56COGD27A3M5WV3MVL","short_pith_number":"pith:27FUB4ST","schema_version":"1.0","canonical_sha256":"d7cb40f253ef84e30f5f06d9db576caaca37bd93f3548ef83af3aebe80647c52","source":{"kind":"arxiv","id":"1306.5386","version":6},"attestation_state":"computed","paper":{"title":"A Second-Order Method for Strongly Convex L1-Regularization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jacek Gondzio, Kimon Fountoulakis","submitted_at":"2013-06-23T08:10:40Z","abstract_excerpt":"In this paper a robust second-order method is developed for the solution of strongly convex l1-regularized problems. The main aim is to make the proposed method as inexpensive as possible, while even difficult problems can be efficiently solved. The proposed approach is a primal-dual Newton Conjugate Gradients (pdNCG) method. Convergence properties of pdNCG are studied and worst-case iteration complexity is established. Numerical results are presented on synthetic sparse least-squares problems and real world machine learning problems."},"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":"1306.5386","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-23T08:10:40Z","cross_cats_sorted":[],"title_canon_sha256":"ba552e7d0b09ec777d4ba8a164e0d36f89ab64aa75a287fa6d03371cd24e5780","abstract_canon_sha256":"b6e99972e455d640a4f5388323c605af650fe681b24f82371513e66e4d05eb92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:39.274831Z","signature_b64":"xLwP96/A9BWCEUCaIXo0nI9kcANvAOpCuaX0gIw20XixB51gg8HRpZ1+Yy33X6oPVcLOFriJo/Mus7DHkqEMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7cb40f253ef84e30f5f06d9db576caaca37bd93f3548ef83af3aebe80647c52","last_reissued_at":"2026-05-18T02:29:39.274425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:39.274425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Second-Order Method for Strongly Convex L1-Regularization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jacek Gondzio, Kimon Fountoulakis","submitted_at":"2013-06-23T08:10:40Z","abstract_excerpt":"In this paper a robust second-order method is developed for the solution of strongly convex l1-regularized problems. The main aim is to make the proposed method as inexpensive as possible, while even difficult problems can be efficiently solved. The proposed approach is a primal-dual Newton Conjugate Gradients (pdNCG) method. Convergence properties of pdNCG are studied and worst-case iteration complexity is established. Numerical results are presented on synthetic sparse least-squares problems and real world machine learning problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5386","kind":"arxiv","version":6},"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":"1306.5386","created_at":"2026-05-18T02:29:39.274489+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5386v6","created_at":"2026-05-18T02:29:39.274489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5386","created_at":"2026-05-18T02:29:39.274489+00:00"},{"alias_kind":"pith_short_12","alias_value":"27FUB4ST56CO","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"27FUB4ST56COGD27","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"27FUB4ST","created_at":"2026-05-18T12:27:30.460161+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/27FUB4ST56COGD27A3M5WV3MVL","json":"https://pith.science/pith/27FUB4ST56COGD27A3M5WV3MVL.json","graph_json":"https://pith.science/api/pith-number/27FUB4ST56COGD27A3M5WV3MVL/graph.json","events_json":"https://pith.science/api/pith-number/27FUB4ST56COGD27A3M5WV3MVL/events.json","paper":"https://pith.science/paper/27FUB4ST"},"agent_actions":{"view_html":"https://pith.science/pith/27FUB4ST56COGD27A3M5WV3MVL","download_json":"https://pith.science/pith/27FUB4ST56COGD27A3M5WV3MVL.json","view_paper":"https://pith.science/paper/27FUB4ST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5386&json=true","fetch_graph":"https://pith.science/api/pith-number/27FUB4ST56COGD27A3M5WV3MVL/graph.json","fetch_events":"https://pith.science/api/pith-number/27FUB4ST56COGD27A3M5WV3MVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/27FUB4ST56COGD27A3M5WV3MVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/27FUB4ST56COGD27A3M5WV3MVL/action/storage_attestation","attest_author":"https://pith.science/pith/27FUB4ST56COGD27A3M5WV3MVL/action/author_attestation","sign_citation":"https://pith.science/pith/27FUB4ST56COGD27A3M5WV3MVL/action/citation_signature","submit_replication":"https://pith.science/pith/27FUB4ST56COGD27A3M5WV3MVL/action/replication_record"}},"created_at":"2026-05-18T02:29:39.274489+00:00","updated_at":"2026-05-18T02:29:39.274489+00:00"}