{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LNVWTBGYZCFLNVGXCTL6JDMZEJ","short_pith_number":"pith:LNVWTBGY","canonical_record":{"source":{"id":"1610.06538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-20T19:00:28Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"9f77fe43496452f2267e5f267528034412e25e0eeeb7942b184b96f6269dd326","abstract_canon_sha256":"04450e7d1d90a7697fbab3ae6ccb6b575a5915328c4be645a3322768b16db059"},"schema_version":"1.0"},"canonical_sha256":"5b6b6984d8c88ab6d4d714d7e48d99225c357ae3a8f1ce8f4b36d6399d52caf9","source":{"kind":"arxiv","id":"1610.06538","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06538","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06538v1","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06538","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"LNVWTBGYZCFL","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LNVWTBGYZCFLNVGX","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LNVWTBGY","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LNVWTBGYZCFLNVGXCTL6JDMZEJ","target":"record","payload":{"canonical_record":{"source":{"id":"1610.06538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-20T19:00:28Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"9f77fe43496452f2267e5f267528034412e25e0eeeb7942b184b96f6269dd326","abstract_canon_sha256":"04450e7d1d90a7697fbab3ae6ccb6b575a5915328c4be645a3322768b16db059"},"schema_version":"1.0"},"canonical_sha256":"5b6b6984d8c88ab6d4d714d7e48d99225c357ae3a8f1ce8f4b36d6399d52caf9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:42.938429Z","signature_b64":"pG5E8LTgirrQ4qSFFHYQH9pPI/H1Ao/fxiuN7ZrhzRPuuwil4z8EU/9TlPrLxgPl2kwHH+CP7lLEhzmIcmUXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b6b6984d8c88ab6d4d714d7e48d99225c357ae3a8f1ce8f4b36d6399d52caf9","last_reissued_at":"2026-05-18T01:01:42.937822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:42.937822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.06538","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:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhT9PgJyS7mBLBg94JF72rc5AQkb6aZ0ioD7serTtXyRyoJQZuJkmeX4LXznewT59MIcJIHGYcki0t+l5lGPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T13:50:54.557156Z"},"content_sha256":"6dea51bac73b7383a48955c3fa8e59e2d5085c99e8308057dec034ca192f521b","schema_version":"1.0","event_id":"sha256:6dea51bac73b7383a48955c3fa8e59e2d5085c99e8308057dec034ca192f521b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LNVWTBGYZCFLNVGXCTL6JDMZEJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A general double-proximal gradient algorithm for d.c. programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Radu Ioan Bot, Sebastian Banert","submitted_at":"2016-10-20T19:00:28Z","abstract_excerpt":"The possibilities of exploiting the special structure of d.c. programs, which consist of optimizing the difference of convex functions, are currently more or less limited to variants of the DCA proposed by Pham Dinh Tao and Le Thi Hoai An in 1997. These assume that either the convex or the concave part, or both, are evaluated by one of their subgradients.\n  In this paper we propose an algorithm which allows the evaluation of both the concave and the convex part by their proximal points. Additionally, we allow a smooth part, which is evaluated via its gradient. In the spirit of primal-dual spli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06538","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:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qNpLwwgC9NpCvJnHqepq2qyAehw7HEk7AYAH5M9LZzzaJoVain0iBOACWl7iR0kDmuXwxrTQbOJxARn6wlNsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T13:50:54.557532Z"},"content_sha256":"4ee068f968d6db47ab778d974a852f18e02ec3c7e2286e2f37665e42cc1d4db6","schema_version":"1.0","event_id":"sha256:4ee068f968d6db47ab778d974a852f18e02ec3c7e2286e2f37665e42cc1d4db6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNVWTBGYZCFLNVGXCTL6JDMZEJ/bundle.json","state_url":"https://pith.science/pith/LNVWTBGYZCFLNVGXCTL6JDMZEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNVWTBGYZCFLNVGXCTL6JDMZEJ/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-20T13:50:54Z","links":{"resolver":"https://pith.science/pith/LNVWTBGYZCFLNVGXCTL6JDMZEJ","bundle":"https://pith.science/pith/LNVWTBGYZCFLNVGXCTL6JDMZEJ/bundle.json","state":"https://pith.science/pith/LNVWTBGYZCFLNVGXCTL6JDMZEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNVWTBGYZCFLNVGXCTL6JDMZEJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LNVWTBGYZCFLNVGXCTL6JDMZEJ","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":"04450e7d1d90a7697fbab3ae6ccb6b575a5915328c4be645a3322768b16db059","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-20T19:00:28Z","title_canon_sha256":"9f77fe43496452f2267e5f267528034412e25e0eeeb7942b184b96f6269dd326"},"schema_version":"1.0","source":{"id":"1610.06538","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06538","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06538v1","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06538","created_at":"2026-05-18T01:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"LNVWTBGYZCFL","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LNVWTBGYZCFLNVGX","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LNVWTBGY","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:4ee068f968d6db47ab778d974a852f18e02ec3c7e2286e2f37665e42cc1d4db6","target":"graph","created_at":"2026-05-18T01:01: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 possibilities of exploiting the special structure of d.c. programs, which consist of optimizing the difference of convex functions, are currently more or less limited to variants of the DCA proposed by Pham Dinh Tao and Le Thi Hoai An in 1997. These assume that either the convex or the concave part, or both, are evaluated by one of their subgradients.\n  In this paper we propose an algorithm which allows the evaluation of both the concave and the convex part by their proximal points. Additionally, we allow a smooth part, which is evaluated via its gradient. In the spirit of primal-dual spli","authors_text":"Radu Ioan Bot, Sebastian Banert","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-20T19:00:28Z","title":"A general double-proximal gradient algorithm for d.c. programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06538","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:6dea51bac73b7383a48955c3fa8e59e2d5085c99e8308057dec034ca192f521b","target":"record","created_at":"2026-05-18T01:01: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":"04450e7d1d90a7697fbab3ae6ccb6b575a5915328c4be645a3322768b16db059","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-20T19:00:28Z","title_canon_sha256":"9f77fe43496452f2267e5f267528034412e25e0eeeb7942b184b96f6269dd326"},"schema_version":"1.0","source":{"id":"1610.06538","kind":"arxiv","version":1}},"canonical_sha256":"5b6b6984d8c88ab6d4d714d7e48d99225c357ae3a8f1ce8f4b36d6399d52caf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b6b6984d8c88ab6d4d714d7e48d99225c357ae3a8f1ce8f4b36d6399d52caf9","first_computed_at":"2026-05-18T01:01:42.937822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:42.937822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pG5E8LTgirrQ4qSFFHYQH9pPI/H1Ao/fxiuN7ZrhzRPuuwil4z8EU/9TlPrLxgPl2kwHH+CP7lLEhzmIcmUXCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:42.938429Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06538","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6dea51bac73b7383a48955c3fa8e59e2d5085c99e8308057dec034ca192f521b","sha256:4ee068f968d6db47ab778d974a852f18e02ec3c7e2286e2f37665e42cc1d4db6"],"state_sha256":"43d74e83b1f4ea77df0776631c784f14ea75a9f6a366378ca33198685e274035"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+qRWlxuzqf06p+8iIkwa+FXh94hClKlVJLxFl/bjUZwETOpQy8n/XW9hYrO85snr1+Ej7EKkBSM8QFQeiMoAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T13:50:54.559552Z","bundle_sha256":"6fb463258a2b1587c65845cebeff1a377e532eb5c023a7577b5f0e05e901cf7f"}}