{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FLTY542MXUSLMRM2RIJARWAXRD","short_pith_number":"pith:FLTY542M","canonical_record":{"source":{"id":"1609.06576","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-21T14:23:33Z","cross_cats_sorted":[],"title_canon_sha256":"be9ca5ccdc351f8a28f2850521e18576b732166ea7f836f9d4f6db5729b90df5","abstract_canon_sha256":"48b741c636f5f213f5440e2e128910dc34f5fc7c42bef83e70ed466220284b34"},"schema_version":"1.0"},"canonical_sha256":"2ae78ef34cbd24b6459a8a1208d81788ce210525944e61ac63d10384af9f03f2","source":{"kind":"arxiv","id":"1609.06576","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06576","created_at":"2026-05-18T01:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06576v1","created_at":"2026-05-18T01:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06576","created_at":"2026-05-18T01:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"FLTY542MXUSL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FLTY542MXUSLMRM2","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FLTY542M","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FLTY542MXUSLMRM2RIJARWAXRD","target":"record","payload":{"canonical_record":{"source":{"id":"1609.06576","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-21T14:23:33Z","cross_cats_sorted":[],"title_canon_sha256":"be9ca5ccdc351f8a28f2850521e18576b732166ea7f836f9d4f6db5729b90df5","abstract_canon_sha256":"48b741c636f5f213f5440e2e128910dc34f5fc7c42bef83e70ed466220284b34"},"schema_version":"1.0"},"canonical_sha256":"2ae78ef34cbd24b6459a8a1208d81788ce210525944e61ac63d10384af9f03f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:07.872754Z","signature_b64":"eH5uPGrinYN6QpNR+W2Muz1cvRkaDvy38oal3RmdSrF05TbtI6pVdWMY9tpApGMNfzXoz11M4LSr+Rov0IfXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ae78ef34cbd24b6459a8a1208d81788ce210525944e61ac63d10384af9f03f2","last_reissued_at":"2026-05-18T01:04:07.872068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:07.872068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.06576","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:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"++g2IFWG1ckoas+iXcYwaGg7KHBOvVzyDNoWcCmfcWv0i35sZw8LgaM6vHa4Ntnwo8F6AcpjTVkzamD+DQreBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:11:00.841856Z"},"content_sha256":"188294df173425ccfa49f6f138f234ccede75e0123c719326393a3aaf7234cc0","schema_version":"1.0","event_id":"sha256:188294df173425ccfa49f6f138f234ccede75e0123c719326393a3aaf7234cc0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FLTY542MXUSLMRM2RIJARWAXRD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence of dual ascent in non-convex/non-differentiable optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carl Olsson, Fredrik Andersson, Marcus Carlsson","submitted_at":"2016-09-21T14:23:33Z","abstract_excerpt":"We revisit the classical dual ascent algorithm for minimization of convex functionals in the presence of linear constraints, and give convergence results which apply even for non-convex functionals. We describe limit points in terms of the convex envelope. We also introduce a new augmented version, which is shown to have superior convergence properties, and provide new results even for convex but non-differentiable objective functionals (as well as non-convex).\n  The results are applied to low rank approximation of a given matrix, subject to linear constraints. In particular, letting the linea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06576","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:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rv6n+LX09gS3/s7fmd3AtiqCfI1AYyifTmjTLP2f0gzwXOTjJIfy2YqQ+F5SHKU/S85KWHg7e6Os8CS+Gsq7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:11:00.842552Z"},"content_sha256":"7ce8224f03f674ba41d05d02449d5e901b052ebfaa5e8d9bea45b99357416135","schema_version":"1.0","event_id":"sha256:7ce8224f03f674ba41d05d02449d5e901b052ebfaa5e8d9bea45b99357416135"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FLTY542MXUSLMRM2RIJARWAXRD/bundle.json","state_url":"https://pith.science/pith/FLTY542MXUSLMRM2RIJARWAXRD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FLTY542MXUSLMRM2RIJARWAXRD/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-07T06:11:00Z","links":{"resolver":"https://pith.science/pith/FLTY542MXUSLMRM2RIJARWAXRD","bundle":"https://pith.science/pith/FLTY542MXUSLMRM2RIJARWAXRD/bundle.json","state":"https://pith.science/pith/FLTY542MXUSLMRM2RIJARWAXRD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FLTY542MXUSLMRM2RIJARWAXRD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FLTY542MXUSLMRM2RIJARWAXRD","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":"48b741c636f5f213f5440e2e128910dc34f5fc7c42bef83e70ed466220284b34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-21T14:23:33Z","title_canon_sha256":"be9ca5ccdc351f8a28f2850521e18576b732166ea7f836f9d4f6db5729b90df5"},"schema_version":"1.0","source":{"id":"1609.06576","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06576","created_at":"2026-05-18T01:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06576v1","created_at":"2026-05-18T01:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06576","created_at":"2026-05-18T01:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"FLTY542MXUSL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FLTY542MXUSLMRM2","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FLTY542M","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:7ce8224f03f674ba41d05d02449d5e901b052ebfaa5e8d9bea45b99357416135","target":"graph","created_at":"2026-05-18T01:04:07Z","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 revisit the classical dual ascent algorithm for minimization of convex functionals in the presence of linear constraints, and give convergence results which apply even for non-convex functionals. We describe limit points in terms of the convex envelope. We also introduce a new augmented version, which is shown to have superior convergence properties, and provide new results even for convex but non-differentiable objective functionals (as well as non-convex).\n  The results are applied to low rank approximation of a given matrix, subject to linear constraints. In particular, letting the linea","authors_text":"Carl Olsson, Fredrik Andersson, Marcus Carlsson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-21T14:23:33Z","title":"Convergence of dual ascent in non-convex/non-differentiable optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06576","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:188294df173425ccfa49f6f138f234ccede75e0123c719326393a3aaf7234cc0","target":"record","created_at":"2026-05-18T01:04:07Z","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":"48b741c636f5f213f5440e2e128910dc34f5fc7c42bef83e70ed466220284b34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-21T14:23:33Z","title_canon_sha256":"be9ca5ccdc351f8a28f2850521e18576b732166ea7f836f9d4f6db5729b90df5"},"schema_version":"1.0","source":{"id":"1609.06576","kind":"arxiv","version":1}},"canonical_sha256":"2ae78ef34cbd24b6459a8a1208d81788ce210525944e61ac63d10384af9f03f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ae78ef34cbd24b6459a8a1208d81788ce210525944e61ac63d10384af9f03f2","first_computed_at":"2026-05-18T01:04:07.872068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:07.872068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eH5uPGrinYN6QpNR+W2Muz1cvRkaDvy38oal3RmdSrF05TbtI6pVdWMY9tpApGMNfzXoz11M4LSr+Rov0IfXBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:07.872754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.06576","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:188294df173425ccfa49f6f138f234ccede75e0123c719326393a3aaf7234cc0","sha256:7ce8224f03f674ba41d05d02449d5e901b052ebfaa5e8d9bea45b99357416135"],"state_sha256":"8c6ad4abc9e145a25d9e4dbcbbd085bbc1af8c392d5d1b4f4802b6889ac373ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uY76YCPSQs9nDzy/aSj9zuhx4AKOz2oYLrkqdMv2zznCESvSnQU4SWdq3sb12r5HAMnxpVolpVfWHlig6HiGDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:11:00.846255Z","bundle_sha256":"d14a7f388d57674f0085b4fbae39ec79026f8427c7cdd2c305e21a3d815b8c06"}}