{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7EBGVBV47OT5U3SH3LFPFKAOQ3","short_pith_number":"pith:7EBGVBV4","canonical_record":{"source":{"id":"1212.6492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-12-28T09:30:57Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"0ca530c302d6c1b1d1abee4391f1111ddf0dfc3de516edcfcd4154a028d660ec","abstract_canon_sha256":"bece11814cce09dd24bd5e5c8594223c81dca57f0480b1692702725528f3bc13"},"schema_version":"1.0"},"canonical_sha256":"f9026a86bcfba7da6e47dacaf2a80e86f5d9964427201ae96d198f34e32f030f","source":{"kind":"arxiv","id":"1212.6492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6492","created_at":"2026-05-18T03:37:31Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6492v1","created_at":"2026-05-18T03:37:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6492","created_at":"2026-05-18T03:37:31Z"},{"alias_kind":"pith_short_12","alias_value":"7EBGVBV47OT5","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7EBGVBV47OT5U3SH","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7EBGVBV4","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7EBGVBV47OT5U3SH3LFPFKAOQ3","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-12-28T09:30:57Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"0ca530c302d6c1b1d1abee4391f1111ddf0dfc3de516edcfcd4154a028d660ec","abstract_canon_sha256":"bece11814cce09dd24bd5e5c8594223c81dca57f0480b1692702725528f3bc13"},"schema_version":"1.0"},"canonical_sha256":"f9026a86bcfba7da6e47dacaf2a80e86f5d9964427201ae96d198f34e32f030f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:31.799223Z","signature_b64":"3ahgyF0pZyKbgJSun5GLwFMy1l9eR0LTNPTD1f5QoxIhd14PFhGbBXJdhEDlg/S0SFcY0toDY4kXZB5gDheoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9026a86bcfba7da6e47dacaf2a80e86f5d9964427201ae96d198f34e32f030f","last_reissued_at":"2026-05-18T03:37:31.798524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:31.798524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6492","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-18T03:37:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LvD20UdoqTRJlAuYAPjJt7TrW+kICJDfQ0B7AdxNMFM361KXTYmDzxuVKGsqcUEm3nBv6awSfNv147J7mEXSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:08:33.327953Z"},"content_sha256":"894f3f95bf90bd795728ae573b0b92da1a785fc739a195e365cf457bd51b1dd6","schema_version":"1.0","event_id":"sha256:894f3f95bf90bd795728ae573b0b92da1a785fc739a195e365cf457bd51b1dd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7EBGVBV47OT5U3SH3LFPFKAOQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Canonical Primal-Dual Method for Solving Non-convex Minimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"cs.NA","authors_text":"Changzhi Wu, Chaojie Li, David Yang Gao","submitted_at":"2012-12-28T09:30:57Z","abstract_excerpt":"A new primal-dual algorithm is presented for solving a class of non-convex minimization problems. This algorithm is based on canonical duality theory such that the original non-convex minimization problem is first reformulated as a convex-concave saddle point optimization problem, which is then solved by a quadratically perturbed primal-dual method. %It is proved that the popular SDP method is indeed a special case of the canonical duality theory. Numerical examples are illustrated. Comparing with the existing results, the proposed algorithm can achieve better performance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6492","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-18T03:37:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fpXEVCQPP82cgREe36f0tGchdJRjImkS15XhC1MJ9AEnJibPJWLwaJab+83IpvcG5gtqTbtRTyyGaiZUJgcGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:08:33.328300Z"},"content_sha256":"02baff77c00f7a33aa3df9e5272c02a8b4d3c857832aa7224921170b9d727d03","schema_version":"1.0","event_id":"sha256:02baff77c00f7a33aa3df9e5272c02a8b4d3c857832aa7224921170b9d727d03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7EBGVBV47OT5U3SH3LFPFKAOQ3/bundle.json","state_url":"https://pith.science/pith/7EBGVBV47OT5U3SH3LFPFKAOQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7EBGVBV47OT5U3SH3LFPFKAOQ3/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-23T15:08:33Z","links":{"resolver":"https://pith.science/pith/7EBGVBV47OT5U3SH3LFPFKAOQ3","bundle":"https://pith.science/pith/7EBGVBV47OT5U3SH3LFPFKAOQ3/bundle.json","state":"https://pith.science/pith/7EBGVBV47OT5U3SH3LFPFKAOQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7EBGVBV47OT5U3SH3LFPFKAOQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7EBGVBV47OT5U3SH3LFPFKAOQ3","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":"bece11814cce09dd24bd5e5c8594223c81dca57f0480b1692702725528f3bc13","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-12-28T09:30:57Z","title_canon_sha256":"0ca530c302d6c1b1d1abee4391f1111ddf0dfc3de516edcfcd4154a028d660ec"},"schema_version":"1.0","source":{"id":"1212.6492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6492","created_at":"2026-05-18T03:37:31Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6492v1","created_at":"2026-05-18T03:37:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6492","created_at":"2026-05-18T03:37:31Z"},{"alias_kind":"pith_short_12","alias_value":"7EBGVBV47OT5","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7EBGVBV47OT5U3SH","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7EBGVBV4","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:02baff77c00f7a33aa3df9e5272c02a8b4d3c857832aa7224921170b9d727d03","target":"graph","created_at":"2026-05-18T03:37:31Z","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":"A new primal-dual algorithm is presented for solving a class of non-convex minimization problems. This algorithm is based on canonical duality theory such that the original non-convex minimization problem is first reformulated as a convex-concave saddle point optimization problem, which is then solved by a quadratically perturbed primal-dual method. %It is proved that the popular SDP method is indeed a special case of the canonical duality theory. Numerical examples are illustrated. Comparing with the existing results, the proposed algorithm can achieve better performance.","authors_text":"Changzhi Wu, Chaojie Li, David Yang Gao","cross_cats":["cs.DS","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-12-28T09:30:57Z","title":"Canonical Primal-Dual Method for Solving Non-convex Minimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6492","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:894f3f95bf90bd795728ae573b0b92da1a785fc739a195e365cf457bd51b1dd6","target":"record","created_at":"2026-05-18T03:37:31Z","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":"bece11814cce09dd24bd5e5c8594223c81dca57f0480b1692702725528f3bc13","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-12-28T09:30:57Z","title_canon_sha256":"0ca530c302d6c1b1d1abee4391f1111ddf0dfc3de516edcfcd4154a028d660ec"},"schema_version":"1.0","source":{"id":"1212.6492","kind":"arxiv","version":1}},"canonical_sha256":"f9026a86bcfba7da6e47dacaf2a80e86f5d9964427201ae96d198f34e32f030f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9026a86bcfba7da6e47dacaf2a80e86f5d9964427201ae96d198f34e32f030f","first_computed_at":"2026-05-18T03:37:31.798524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:31.798524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ahgyF0pZyKbgJSun5GLwFMy1l9eR0LTNPTD1f5QoxIhd14PFhGbBXJdhEDlg/S0SFcY0toDY4kXZB5gDheoBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:31.799223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:894f3f95bf90bd795728ae573b0b92da1a785fc739a195e365cf457bd51b1dd6","sha256:02baff77c00f7a33aa3df9e5272c02a8b4d3c857832aa7224921170b9d727d03"],"state_sha256":"d5f2295d3f28c842f8aba6520c25a7466473e31d7d4d53eea8a9351c877cb417"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V1S/gRrR+tKGUEuvMa2U1M1l6VVtYI8uVJz/NSRg/1ZRmUmYWJ1JraDELSurCtrBqNxjFHLmjS+xzEK5pnKAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:08:33.330254Z","bundle_sha256":"866d0df82719dad860108378096a7359a93a7ebd499fce03341fd2b26d714721"}}