{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:27FUB4ST56COGD27A3M5WV3MVL","short_pith_number":"pith:27FUB4ST","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"},"canonical_sha256":"d7cb40f253ef84e30f5f06d9db576caaca37bd93f3548ef83af3aebe80647c52","source":{"kind":"arxiv","id":"1306.5386","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5386","created_at":"2026-05-18T02:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5386v6","created_at":"2026-05-18T02:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5386","created_at":"2026-05-18T02:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"27FUB4ST56CO","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"27FUB4ST56COGD27","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"27FUB4ST","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:27FUB4ST56COGD27A3M5WV3MVL","target":"record","payload":{"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"},"canonical_sha256":"d7cb40f253ef84e30f5f06d9db576caaca37bd93f3548ef83af3aebe80647c52","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"},"source_kind":"arxiv","source_id":"1306.5386","source_version":6,"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-18T02:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N3KT2CQuVrf/qEVnaaGRy6/ugbEEm4IRzR6S2Watyw7/rPc8UbjuyYdcZ6vvT57KaD6Ru+8QssrgDFTTwf1YAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:24:57.674311Z"},"content_sha256":"cae5a2a346ff9e416a47319fa6bfbd0e3bc11f7fd60b8e4a1423986508218e0d","schema_version":"1.0","event_id":"sha256:cae5a2a346ff9e416a47319fa6bfbd0e3bc11f7fd60b8e4a1423986508218e0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:27FUB4ST56COGD27A3M5WV3MVL","target":"graph","payload":{"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"},"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-18T02:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tf4YmPvjUX5DrFLJMdF2Ir6ms61jGuNQKEDGRVley5mHwqYblHh8Dl+qNQu2gYkSFMjQTczqWdSIpQrhCQCiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:24:57.674667Z"},"content_sha256":"7728c6d42101ec6010f023d4bd9ba9433419acad658a7104e3f6a08dea47ef42","schema_version":"1.0","event_id":"sha256:7728c6d42101ec6010f023d4bd9ba9433419acad658a7104e3f6a08dea47ef42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/27FUB4ST56COGD27A3M5WV3MVL/bundle.json","state_url":"https://pith.science/pith/27FUB4ST56COGD27A3M5WV3MVL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/27FUB4ST56COGD27A3M5WV3MVL/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-06-01T11:24:57Z","links":{"resolver":"https://pith.science/pith/27FUB4ST56COGD27A3M5WV3MVL","bundle":"https://pith.science/pith/27FUB4ST56COGD27A3M5WV3MVL/bundle.json","state":"https://pith.science/pith/27FUB4ST56COGD27A3M5WV3MVL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/27FUB4ST56COGD27A3M5WV3MVL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:27FUB4ST56COGD27A3M5WV3MVL","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":"b6e99972e455d640a4f5388323c605af650fe681b24f82371513e66e4d05eb92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-23T08:10:40Z","title_canon_sha256":"ba552e7d0b09ec777d4ba8a164e0d36f89ab64aa75a287fa6d03371cd24e5780"},"schema_version":"1.0","source":{"id":"1306.5386","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5386","created_at":"2026-05-18T02:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5386v6","created_at":"2026-05-18T02:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5386","created_at":"2026-05-18T02:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"27FUB4ST56CO","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"27FUB4ST56COGD27","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"27FUB4ST","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:7728c6d42101ec6010f023d4bd9ba9433419acad658a7104e3f6a08dea47ef42","target":"graph","created_at":"2026-05-18T02:29:39Z","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":"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.","authors_text":"Jacek Gondzio, Kimon Fountoulakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-23T08:10:40Z","title":"A Second-Order Method for Strongly Convex L1-Regularization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5386","kind":"arxiv","version":6},"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:cae5a2a346ff9e416a47319fa6bfbd0e3bc11f7fd60b8e4a1423986508218e0d","target":"record","created_at":"2026-05-18T02:29:39Z","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":"b6e99972e455d640a4f5388323c605af650fe681b24f82371513e66e4d05eb92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-23T08:10:40Z","title_canon_sha256":"ba552e7d0b09ec777d4ba8a164e0d36f89ab64aa75a287fa6d03371cd24e5780"},"schema_version":"1.0","source":{"id":"1306.5386","kind":"arxiv","version":6}},"canonical_sha256":"d7cb40f253ef84e30f5f06d9db576caaca37bd93f3548ef83af3aebe80647c52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7cb40f253ef84e30f5f06d9db576caaca37bd93f3548ef83af3aebe80647c52","first_computed_at":"2026-05-18T02:29:39.274425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:39.274425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xLwP96/A9BWCEUCaIXo0nI9kcANvAOpCuaX0gIw20XixB51gg8HRpZ1+Yy33X6oPVcLOFriJo/Mus7DHkqEMAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:39.274831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.5386","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cae5a2a346ff9e416a47319fa6bfbd0e3bc11f7fd60b8e4a1423986508218e0d","sha256:7728c6d42101ec6010f023d4bd9ba9433419acad658a7104e3f6a08dea47ef42"],"state_sha256":"fd69a817befdc36bfe346f810fddebff948f4e574e29064b664f577c6fca042d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DoKtAlwWoNM4LDdaGLN77lR114sivrEwddIO8m57sS7UdSRx9gkKkiJze54uDZvnNo7typDHliyabiI/rOBsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:24:57.676548Z","bundle_sha256":"408778fd5df195aa2dbf3da946f24fe05c1bf5c49f8e9b8e5b5933d97a27da3c"}}