{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JACLDDRFM3Z7LY53VXROT2VAIO","short_pith_number":"pith:JACLDDRF","canonical_record":{"source":{"id":"1207.6710","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-28T16:39:56Z","cross_cats_sorted":[],"title_canon_sha256":"8a42b457308940c483713874db4dd36e9898c186432e7bdb1b58fb0df3a95ad4","abstract_canon_sha256":"283dfcfb4e916ee08971a1e0f727278f1439d192bd31bd4f5b3ccab537841a14"},"schema_version":"1.0"},"canonical_sha256":"4804b18e2566f3f5e3bbade2e9eaa043815b77056980e81a569a01d2ce9cb9bd","source":{"kind":"arxiv","id":"1207.6710","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6710","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6710v2","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6710","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"pith_short_12","alias_value":"JACLDDRFM3Z7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JACLDDRFM3Z7LY53","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JACLDDRF","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JACLDDRFM3Z7LY53VXROT2VAIO","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6710","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-28T16:39:56Z","cross_cats_sorted":[],"title_canon_sha256":"8a42b457308940c483713874db4dd36e9898c186432e7bdb1b58fb0df3a95ad4","abstract_canon_sha256":"283dfcfb4e916ee08971a1e0f727278f1439d192bd31bd4f5b3ccab537841a14"},"schema_version":"1.0"},"canonical_sha256":"4804b18e2566f3f5e3bbade2e9eaa043815b77056980e81a569a01d2ce9cb9bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:13.444914Z","signature_b64":"T4+HnSA3zvbDUv5veJrDEMUQxN89BnwynZRZx+ypu5Rf04WSVWHpXq6+CXtI7GDylQJz7Cj91eljmZIlHpShAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4804b18e2566f3f5e3bbade2e9eaa043815b77056980e81a569a01d2ce9cb9bd","last_reissued_at":"2026-05-18T03:44:13.444435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:13.444435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6710","source_version":2,"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:44:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5M2nDdeOJflSNcoc2eTz85hBKBwJ1k3dwz/p2zga4t73IkvQ23WijZZc60Z9X40a2us8CJM9GWaQbErq/wmBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:07:46.352974Z"},"content_sha256":"47b89d24f532b2d9505087710a4086e027b4cf1bb9ee05b88ad6b7e26a4c0cf0","schema_version":"1.0","event_id":"sha256:47b89d24f532b2d9505087710a4086e027b4cf1bb9ee05b88ad6b7e26a4c0cf0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JACLDDRFM3Z7LY53VXROT2VAIO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Four strategies to develop canonical dual algorithms for global optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Xiaojun Zhou","submitted_at":"2012-07-28T16:39:56Z","abstract_excerpt":"The canonical duality theory has provided with a unified analytic solution to a range of discrete and continuous problems in global optimization, which can transform a nonconvex primal problem to a concave maximization dual problem over a convex domain without duality gap. This paper shows that under certain conditions, this canonical dual problem is equivalent to the standard semi-definite programming (SDP) problem, which can be solved by well-developed software packages. In order to avoid certain difficulties of using the SDP method, four strategies are proposed based on unconstrained approa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6710","kind":"arxiv","version":2},"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:44:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vHAtuULy3bu41a51IJFE07jcDxe6M1Yqiynf0BvEihhLnwYtx+mHhGgoR0zI4MF9jez+V3NCOcPU+HcJgLtkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:07:46.353731Z"},"content_sha256":"9c22f48b12767bbf22b18b956751d3e81013d3670b17aeedff3c97470e93548d","schema_version":"1.0","event_id":"sha256:9c22f48b12767bbf22b18b956751d3e81013d3670b17aeedff3c97470e93548d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JACLDDRFM3Z7LY53VXROT2VAIO/bundle.json","state_url":"https://pith.science/pith/JACLDDRFM3Z7LY53VXROT2VAIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JACLDDRFM3Z7LY53VXROT2VAIO/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-09T02:07:46Z","links":{"resolver":"https://pith.science/pith/JACLDDRFM3Z7LY53VXROT2VAIO","bundle":"https://pith.science/pith/JACLDDRFM3Z7LY53VXROT2VAIO/bundle.json","state":"https://pith.science/pith/JACLDDRFM3Z7LY53VXROT2VAIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JACLDDRFM3Z7LY53VXROT2VAIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JACLDDRFM3Z7LY53VXROT2VAIO","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":"283dfcfb4e916ee08971a1e0f727278f1439d192bd31bd4f5b3ccab537841a14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-28T16:39:56Z","title_canon_sha256":"8a42b457308940c483713874db4dd36e9898c186432e7bdb1b58fb0df3a95ad4"},"schema_version":"1.0","source":{"id":"1207.6710","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6710","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6710v2","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6710","created_at":"2026-05-18T03:44:13Z"},{"alias_kind":"pith_short_12","alias_value":"JACLDDRFM3Z7","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JACLDDRFM3Z7LY53","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JACLDDRF","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:9c22f48b12767bbf22b18b956751d3e81013d3670b17aeedff3c97470e93548d","target":"graph","created_at":"2026-05-18T03:44:13Z","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 canonical duality theory has provided with a unified analytic solution to a range of discrete and continuous problems in global optimization, which can transform a nonconvex primal problem to a concave maximization dual problem over a convex domain without duality gap. This paper shows that under certain conditions, this canonical dual problem is equivalent to the standard semi-definite programming (SDP) problem, which can be solved by well-developed software packages. In order to avoid certain difficulties of using the SDP method, four strategies are proposed based on unconstrained approa","authors_text":"Xiaojun Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-28T16:39:56Z","title":"Four strategies to develop canonical dual algorithms for global optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6710","kind":"arxiv","version":2},"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:47b89d24f532b2d9505087710a4086e027b4cf1bb9ee05b88ad6b7e26a4c0cf0","target":"record","created_at":"2026-05-18T03:44:13Z","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":"283dfcfb4e916ee08971a1e0f727278f1439d192bd31bd4f5b3ccab537841a14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-28T16:39:56Z","title_canon_sha256":"8a42b457308940c483713874db4dd36e9898c186432e7bdb1b58fb0df3a95ad4"},"schema_version":"1.0","source":{"id":"1207.6710","kind":"arxiv","version":2}},"canonical_sha256":"4804b18e2566f3f5e3bbade2e9eaa043815b77056980e81a569a01d2ce9cb9bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4804b18e2566f3f5e3bbade2e9eaa043815b77056980e81a569a01d2ce9cb9bd","first_computed_at":"2026-05-18T03:44:13.444435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:13.444435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T4+HnSA3zvbDUv5veJrDEMUQxN89BnwynZRZx+ypu5Rf04WSVWHpXq6+CXtI7GDylQJz7Cj91eljmZIlHpShAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:13.444914Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6710","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47b89d24f532b2d9505087710a4086e027b4cf1bb9ee05b88ad6b7e26a4c0cf0","sha256:9c22f48b12767bbf22b18b956751d3e81013d3670b17aeedff3c97470e93548d"],"state_sha256":"c8b64e59a532ef007568833cbb34ca0fea816bfb1dc62fbdaa18e9748f119a89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vkJorarrjror6AytuPljRon/1lEf0W/4OCDD0JIa+wZ39XnCZVxmlO/Yd3spF1G6dItAqZP7YwNpoXRQiQ3LBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:07:46.357923Z","bundle_sha256":"18b273892a2d95344b5aa642ca7c51f6ea9dd0519ce44d2a29421941ef5696ce"}}