{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GB4BDWAP7CZNICGULJPSY7OYD5","short_pith_number":"pith:GB4BDWAP","canonical_record":{"source":{"id":"1507.00438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-02T06:41:32Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"7a343630fb27073db66706c7aa6d54c751f9f5aece607fa4358ef69156592740","abstract_canon_sha256":"2ee5704d5fd8aecf058d8e5b03f207c3ae385c2f8c0099876f760f55580dced4"},"schema_version":"1.0"},"canonical_sha256":"307811d80ff8b2d408d45a5f2c7dd81f62348c005f46eb26c5de967438795009","source":{"kind":"arxiv","id":"1507.00438","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00438","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00438v1","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00438","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"pith_short_12","alias_value":"GB4BDWAP7CZN","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GB4BDWAP7CZNICGU","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GB4BDWAP","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GB4BDWAP7CZNICGULJPSY7OYD5","target":"record","payload":{"canonical_record":{"source":{"id":"1507.00438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-02T06:41:32Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"7a343630fb27073db66706c7aa6d54c751f9f5aece607fa4358ef69156592740","abstract_canon_sha256":"2ee5704d5fd8aecf058d8e5b03f207c3ae385c2f8c0099876f760f55580dced4"},"schema_version":"1.0"},"canonical_sha256":"307811d80ff8b2d408d45a5f2c7dd81f62348c005f46eb26c5de967438795009","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:24.733933Z","signature_b64":"b5VXTHq/8hrrklpE6qluQ0YDzRvExGcMcyth2enx4BEIeXXfQfFmuwN9bF212D3RKP8nWS93JxKRo09j7ai3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"307811d80ff8b2d408d45a5f2c7dd81f62348c005f46eb26c5de967438795009","last_reissued_at":"2026-05-18T01:37:24.733190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:24.733190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.00438","source_version":1,"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-18T01:37:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MmBA74iZsg/qK4FqBj/uQeGaCcpJVi78elyGKFNMddsRGF2XWBKERd5OrifkaqBybg9qfozYkKCZQJanBtM3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:29:39.138872Z"},"content_sha256":"1f4a5987d22476dd3f68da378a3d3345d662699397eb258add1fb3796357a2b9","schema_version":"1.0","event_id":"sha256:1f4a5987d22476dd3f68da378a3d3345d662699397eb258add1fb3796357a2b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GB4BDWAP7CZNICGULJPSY7OYD5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DC Proximal Newton for Non-Convex Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alain Rakotomamonjy (LITIS), Gilles Gasso (LITIS), Oca), Remi Flamary (LAGRANGE","submitted_at":"2015-07-02T06:41:32Z","abstract_excerpt":"We introduce a novel algorithm for solving learning problems where both the loss function and the regularizer are non-convex but belong to the class of difference of convex (DC) functions. Our contribution is a new general purpose proximal Newton algorithm that is able to deal with such a situation. The algorithm consists in obtaining a descent direction from an approximation of the loss function and then in performing a line search to ensure sufficient descent. A theoretical analysis is provided showing that the iterates of the proposed algorithm {admit} as limit points stationary points of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00438","kind":"arxiv","version":1},"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-18T01:37:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vz9FzD7dJrJqAq39FF7TsEfVjOkLHbrqyqdeZI1SAWUd0Gg1Zug1ASvh8r2fg8kkmEyfxCkKw41UCRgR0PA9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:29:39.139200Z"},"content_sha256":"0113ed6018df5d50ddc04d1385a6ecbc6e473258e77397a291d07afd27b4f3d0","schema_version":"1.0","event_id":"sha256:0113ed6018df5d50ddc04d1385a6ecbc6e473258e77397a291d07afd27b4f3d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GB4BDWAP7CZNICGULJPSY7OYD5/bundle.json","state_url":"https://pith.science/pith/GB4BDWAP7CZNICGULJPSY7OYD5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GB4BDWAP7CZNICGULJPSY7OYD5/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-02T13:29:39Z","links":{"resolver":"https://pith.science/pith/GB4BDWAP7CZNICGULJPSY7OYD5","bundle":"https://pith.science/pith/GB4BDWAP7CZNICGULJPSY7OYD5/bundle.json","state":"https://pith.science/pith/GB4BDWAP7CZNICGULJPSY7OYD5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GB4BDWAP7CZNICGULJPSY7OYD5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GB4BDWAP7CZNICGULJPSY7OYD5","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":"2ee5704d5fd8aecf058d8e5b03f207c3ae385c2f8c0099876f760f55580dced4","cross_cats_sorted":["cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-02T06:41:32Z","title_canon_sha256":"7a343630fb27073db66706c7aa6d54c751f9f5aece607fa4358ef69156592740"},"schema_version":"1.0","source":{"id":"1507.00438","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00438","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00438v1","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00438","created_at":"2026-05-18T01:37:24Z"},{"alias_kind":"pith_short_12","alias_value":"GB4BDWAP7CZN","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GB4BDWAP7CZNICGU","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GB4BDWAP","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:0113ed6018df5d50ddc04d1385a6ecbc6e473258e77397a291d07afd27b4f3d0","target":"graph","created_at":"2026-05-18T01:37:24Z","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":"We introduce a novel algorithm for solving learning problems where both the loss function and the regularizer are non-convex but belong to the class of difference of convex (DC) functions. Our contribution is a new general purpose proximal Newton algorithm that is able to deal with such a situation. The algorithm consists in obtaining a descent direction from an approximation of the loss function and then in performing a line search to ensure sufficient descent. A theoretical analysis is provided showing that the iterates of the proposed algorithm {admit} as limit points stationary points of t","authors_text":"Alain Rakotomamonjy (LITIS), Gilles Gasso (LITIS), Oca), Remi Flamary (LAGRANGE","cross_cats":["cs.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-02T06:41:32Z","title":"DC Proximal Newton for Non-Convex Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00438","kind":"arxiv","version":1},"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:1f4a5987d22476dd3f68da378a3d3345d662699397eb258add1fb3796357a2b9","target":"record","created_at":"2026-05-18T01:37:24Z","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":"2ee5704d5fd8aecf058d8e5b03f207c3ae385c2f8c0099876f760f55580dced4","cross_cats_sorted":["cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-02T06:41:32Z","title_canon_sha256":"7a343630fb27073db66706c7aa6d54c751f9f5aece607fa4358ef69156592740"},"schema_version":"1.0","source":{"id":"1507.00438","kind":"arxiv","version":1}},"canonical_sha256":"307811d80ff8b2d408d45a5f2c7dd81f62348c005f46eb26c5de967438795009","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"307811d80ff8b2d408d45a5f2c7dd81f62348c005f46eb26c5de967438795009","first_computed_at":"2026-05-18T01:37:24.733190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:24.733190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b5VXTHq/8hrrklpE6qluQ0YDzRvExGcMcyth2enx4BEIeXXfQfFmuwN9bF212D3RKP8nWS93JxKRo09j7ai3Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:24.733933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00438","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f4a5987d22476dd3f68da378a3d3345d662699397eb258add1fb3796357a2b9","sha256:0113ed6018df5d50ddc04d1385a6ecbc6e473258e77397a291d07afd27b4f3d0"],"state_sha256":"60f0e42db0bb8632e2ee758d89e1e9887f9f897001e73a4a9432aa08e1ec3b9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6vWxPQuPYzEF5y4aK8XkB0T9QD9FAlGSTCGRkLiUmsDoL3T9B7TQJckYu3vmz7/j/5xjq4c2vBMDAYMU4lj+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:29:39.140920Z","bundle_sha256":"6676b6d8bb3eaf395bdff115fcf410daac2883094f9ffdeedf096f30bb35b834"}}