{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QLGJ46O55EUV4JQA6TKNF44535","short_pith_number":"pith:QLGJ46O5","canonical_record":{"source":{"id":"1801.00261","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-31T10:04:00Z","cross_cats_sorted":[],"title_canon_sha256":"a9babce4487ad803e3df3ea187778cf70bea395bd1003c28b0195d8472c8e342","abstract_canon_sha256":"00264d4fe80b92eaf1b6f5be9fcb69e19b7066be060911900403d9d61865cbd8"},"schema_version":"1.0"},"canonical_sha256":"82cc9e79dde9295e2600f4d4d2f39ddf4faffdfd5f1ec32f5f00bdb5b3542038","source":{"kind":"arxiv","id":"1801.00261","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00261","created_at":"2026-07-05T00:16:30Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00261v5","created_at":"2026-07-05T00:16:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00261","created_at":"2026-07-05T00:16:30Z"},{"alias_kind":"pith_short_12","alias_value":"QLGJ46O55EUV","created_at":"2026-07-05T00:16:30Z"},{"alias_kind":"pith_short_16","alias_value":"QLGJ46O55EUV4JQA","created_at":"2026-07-05T00:16:30Z"},{"alias_kind":"pith_short_8","alias_value":"QLGJ46O5","created_at":"2026-07-05T00:16:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QLGJ46O55EUV4JQA6TKNF44535","target":"record","payload":{"canonical_record":{"source":{"id":"1801.00261","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-31T10:04:00Z","cross_cats_sorted":[],"title_canon_sha256":"a9babce4487ad803e3df3ea187778cf70bea395bd1003c28b0195d8472c8e342","abstract_canon_sha256":"00264d4fe80b92eaf1b6f5be9fcb69e19b7066be060911900403d9d61865cbd8"},"schema_version":"1.0"},"canonical_sha256":"82cc9e79dde9295e2600f4d4d2f39ddf4faffdfd5f1ec32f5f00bdb5b3542038","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:30.098824Z","signature_b64":"KiIHHWi5Ob9unOwbvYBzJjrTplwW6zZimkXdziBIL9rYuoe4k6Qu6NfMlNPZP+AhTOSEeMLrguMyoqXGn3WdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82cc9e79dde9295e2600f4d4d2f39ddf4faffdfd5f1ec32f5f00bdb5b3542038","last_reissued_at":"2026-07-05T00:16:30.098396Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:30.098396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.00261","source_version":5,"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-07-05T00:16:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pi2dPjK4d6sXmayhX89+sF+KJzP1X8iDgAaaXLUAAtD+8hr4XL48IBq6LxDvk+J4qMKREgKdVDdy4NAXOoSyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:10:10.102531Z"},"content_sha256":"2137d86f19bfd2f713b303f870c5e37d1b959b2f085b3317a867459b9d66923a","schema_version":"1.0","event_id":"sha256:2137d86f19bfd2f713b303f870c5e37d1b959b2f085b3317a867459b9d66923a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QLGJ46O55EUV4JQA6TKNF44535","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First-Order Primal-Dual Method for Nonlinear Convex Cone Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daoli Zhu, Lei Zhao","submitted_at":"2017-12-31T10:04:00Z","abstract_excerpt":"Nonlinear Convex Cone Programming (NCCP) problems are important and have many practical applications. In this paper, we introduces a flexible first-order primal-dual algorithm called the Variant Auxiliary Problem Principle (VAPP) for solving NCCP problems when the objective function and constraints are smooth and may be nonsmooth. Each iteration of VAPP generates a nonlinear approximation to the primal problem of an augmented Lagrangian method. The approximation incorporates both linearization and a variable distance-like function, and then the iterations of VAPP provide one decomposition prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00261","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1801.00261/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:16:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TAJ8Dd5vAukY87xBWjVTwDLflxsgGAtwXOs0BkGkzvFWpUv2TjpTmITC5XQqg28fHB4bjrqACb3dbHWZTTuqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:10:10.102910Z"},"content_sha256":"becf9d576a7644b286dc71e5d16ffb3d06cee5565625757605843b480990d792","schema_version":"1.0","event_id":"sha256:becf9d576a7644b286dc71e5d16ffb3d06cee5565625757605843b480990d792"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QLGJ46O55EUV4JQA6TKNF44535/bundle.json","state_url":"https://pith.science/pith/QLGJ46O55EUV4JQA6TKNF44535/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QLGJ46O55EUV4JQA6TKNF44535/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-08-12T22:10:10Z","links":{"resolver":"https://pith.science/pith/QLGJ46O55EUV4JQA6TKNF44535","bundle":"https://pith.science/pith/QLGJ46O55EUV4JQA6TKNF44535/bundle.json","state":"https://pith.science/pith/QLGJ46O55EUV4JQA6TKNF44535/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QLGJ46O55EUV4JQA6TKNF44535/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QLGJ46O55EUV4JQA6TKNF44535","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":"00264d4fe80b92eaf1b6f5be9fcb69e19b7066be060911900403d9d61865cbd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-31T10:04:00Z","title_canon_sha256":"a9babce4487ad803e3df3ea187778cf70bea395bd1003c28b0195d8472c8e342"},"schema_version":"1.0","source":{"id":"1801.00261","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00261","created_at":"2026-07-05T00:16:30Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00261v5","created_at":"2026-07-05T00:16:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00261","created_at":"2026-07-05T00:16:30Z"},{"alias_kind":"pith_short_12","alias_value":"QLGJ46O55EUV","created_at":"2026-07-05T00:16:30Z"},{"alias_kind":"pith_short_16","alias_value":"QLGJ46O55EUV4JQA","created_at":"2026-07-05T00:16:30Z"},{"alias_kind":"pith_short_8","alias_value":"QLGJ46O5","created_at":"2026-07-05T00:16:30Z"}],"graph_snapshots":[{"event_id":"sha256:becf9d576a7644b286dc71e5d16ffb3d06cee5565625757605843b480990d792","target":"graph","created_at":"2026-07-05T00:16:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1801.00261/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Nonlinear Convex Cone Programming (NCCP) problems are important and have many practical applications. In this paper, we introduces a flexible first-order primal-dual algorithm called the Variant Auxiliary Problem Principle (VAPP) for solving NCCP problems when the objective function and constraints are smooth and may be nonsmooth. Each iteration of VAPP generates a nonlinear approximation to the primal problem of an augmented Lagrangian method. The approximation incorporates both linearization and a variable distance-like function, and then the iterations of VAPP provide one decomposition prop","authors_text":"Daoli Zhu, Lei Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-31T10:04:00Z","title":"First-Order Primal-Dual Method for Nonlinear Convex Cone Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00261","kind":"arxiv","version":5},"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:2137d86f19bfd2f713b303f870c5e37d1b959b2f085b3317a867459b9d66923a","target":"record","created_at":"2026-07-05T00:16:30Z","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":"00264d4fe80b92eaf1b6f5be9fcb69e19b7066be060911900403d9d61865cbd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-31T10:04:00Z","title_canon_sha256":"a9babce4487ad803e3df3ea187778cf70bea395bd1003c28b0195d8472c8e342"},"schema_version":"1.0","source":{"id":"1801.00261","kind":"arxiv","version":5}},"canonical_sha256":"82cc9e79dde9295e2600f4d4d2f39ddf4faffdfd5f1ec32f5f00bdb5b3542038","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82cc9e79dde9295e2600f4d4d2f39ddf4faffdfd5f1ec32f5f00bdb5b3542038","first_computed_at":"2026-07-05T00:16:30.098396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:16:30.098396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KiIHHWi5Ob9unOwbvYBzJjrTplwW6zZimkXdziBIL9rYuoe4k6Qu6NfMlNPZP+AhTOSEeMLrguMyoqXGn3WdAA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:16:30.098824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00261","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2137d86f19bfd2f713b303f870c5e37d1b959b2f085b3317a867459b9d66923a","sha256:becf9d576a7644b286dc71e5d16ffb3d06cee5565625757605843b480990d792"],"state_sha256":"b63ee55ffcfc89b0b624dc8fc92844cdced12f887090518c1c28c7cf72254e09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RSWCsVLCieMcGYCRBr08XC/xDUVyav5BqoIhCN1APoY0+s3SOuOwxN7LWYbXXw1llAr3mfDJv+49EEksPuKQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T22:10:10.105305Z","bundle_sha256":"7e83eb22a9830867181e940cdfd05a5e862c7c6b7c1cc6bbae6621fe80ed48e5"}}