{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UELLIIAQ3KKNDRFS5WNBDODWF3","short_pith_number":"pith:UELLIIAQ","canonical_record":{"source":{"id":"1712.00227","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-01T08:15:08Z","cross_cats_sorted":[],"title_canon_sha256":"8f204657f60dc45bbf086371f682ab1248399b0fb07e04a8330ef3f5369cca86","abstract_canon_sha256":"c3d7acf08cf7369e30474fe980f10f21ae67ea47def9e721b8fcc31b13a50022"},"schema_version":"1.0"},"canonical_sha256":"a116b42010da94d1c4b2ed9a11b8762ef24a43f063b35ccf3b354e4cf7b29b2f","source":{"kind":"arxiv","id":"1712.00227","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00227","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00227v3","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00227","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"pith_short_12","alias_value":"UELLIIAQ3KKN","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UELLIIAQ3KKNDRFS","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UELLIIAQ","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UELLIIAQ3KKNDRFS5WNBDODWF3","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00227","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-01T08:15:08Z","cross_cats_sorted":[],"title_canon_sha256":"8f204657f60dc45bbf086371f682ab1248399b0fb07e04a8330ef3f5369cca86","abstract_canon_sha256":"c3d7acf08cf7369e30474fe980f10f21ae67ea47def9e721b8fcc31b13a50022"},"schema_version":"1.0"},"canonical_sha256":"a116b42010da94d1c4b2ed9a11b8762ef24a43f063b35ccf3b354e4cf7b29b2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:07.512446Z","signature_b64":"ds2UYRDqjTye1AITa3DX0oNLQrm77rvha1smy67NWNz2A6SbnykbQ8aVKduPL9RofDULSsoJL0Gsj/2B43MsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a116b42010da94d1c4b2ed9a11b8762ef24a43f063b35ccf3b354e4cf7b29b2f","last_reissued_at":"2026-05-17T23:54:07.512009Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:07.512009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00227","source_version":3,"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-17T23:54:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BMrXai25tTiaiiaHArD/zllySUL+oMO68Mf5uUBKF9YXSNeVetuJcYms+RLvPkSEqvummbLX7Vc2Y6Sa8JzpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:20:20.001410Z"},"content_sha256":"32286169231b91f87215da70a6e02f3f3427bb824ff02e82772693292babc86c","schema_version":"1.0","event_id":"sha256:32286169231b91f87215da70a6e02f3f3427bb824ff02e82772693292babc86c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UELLIIAQ3KKNDRFS5WNBDODWF3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved DC Programming Approaches for Solving the Quadratic Eigenvalue Complementarity Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dinh Tao Pham, Hoai An Le Thi, Joaquim Judice, Yi-Shuai Niu","submitted_at":"2017-12-01T08:15:08Z","abstract_excerpt":"In this paper, we discuss the solution of a Quadratic Eigenvalue Complementarity Problem (QEiCP) by using Difference of Convex (DC) programming approaches. We first show that QEiCP can be represented as dc programming problem. Then we investigate different dc programming formulations of QEiCP and discuss their dc algorithms based on a well-known method -- DCA. A new local dc decomposition is proposed which aims at constructing a better dc decomposition regarding to the specific feature of the target problem in some neighborhoods of the iterates. This new procedure yields faster convergence and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00227","kind":"arxiv","version":3},"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-17T23:54:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pmtj9+lxKth5BWuk1XYAHmpE0UsU5QIaEYFHtNMSzBrDS/Hf4eIBiCeJPhghPVcD92q2NRApsOeHp5BGIKLPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:20:20.002113Z"},"content_sha256":"82ddca993aa44c9995c3453de43a9dd98903d91c336d32f48153440103958158","schema_version":"1.0","event_id":"sha256:82ddca993aa44c9995c3453de43a9dd98903d91c336d32f48153440103958158"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UELLIIAQ3KKNDRFS5WNBDODWF3/bundle.json","state_url":"https://pith.science/pith/UELLIIAQ3KKNDRFS5WNBDODWF3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UELLIIAQ3KKNDRFS5WNBDODWF3/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-05-25T14:20:20Z","links":{"resolver":"https://pith.science/pith/UELLIIAQ3KKNDRFS5WNBDODWF3","bundle":"https://pith.science/pith/UELLIIAQ3KKNDRFS5WNBDODWF3/bundle.json","state":"https://pith.science/pith/UELLIIAQ3KKNDRFS5WNBDODWF3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UELLIIAQ3KKNDRFS5WNBDODWF3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UELLIIAQ3KKNDRFS5WNBDODWF3","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":"c3d7acf08cf7369e30474fe980f10f21ae67ea47def9e721b8fcc31b13a50022","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-01T08:15:08Z","title_canon_sha256":"8f204657f60dc45bbf086371f682ab1248399b0fb07e04a8330ef3f5369cca86"},"schema_version":"1.0","source":{"id":"1712.00227","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00227","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00227v3","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00227","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"pith_short_12","alias_value":"UELLIIAQ3KKN","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UELLIIAQ3KKNDRFS","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UELLIIAQ","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:82ddca993aa44c9995c3453de43a9dd98903d91c336d32f48153440103958158","target":"graph","created_at":"2026-05-17T23:54: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":"In this paper, we discuss the solution of a Quadratic Eigenvalue Complementarity Problem (QEiCP) by using Difference of Convex (DC) programming approaches. We first show that QEiCP can be represented as dc programming problem. Then we investigate different dc programming formulations of QEiCP and discuss their dc algorithms based on a well-known method -- DCA. A new local dc decomposition is proposed which aims at constructing a better dc decomposition regarding to the specific feature of the target problem in some neighborhoods of the iterates. This new procedure yields faster convergence and","authors_text":"Dinh Tao Pham, Hoai An Le Thi, Joaquim Judice, Yi-Shuai Niu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-01T08:15:08Z","title":"Improved DC Programming Approaches for Solving the Quadratic Eigenvalue Complementarity Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00227","kind":"arxiv","version":3},"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:32286169231b91f87215da70a6e02f3f3427bb824ff02e82772693292babc86c","target":"record","created_at":"2026-05-17T23:54: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":"c3d7acf08cf7369e30474fe980f10f21ae67ea47def9e721b8fcc31b13a50022","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-01T08:15:08Z","title_canon_sha256":"8f204657f60dc45bbf086371f682ab1248399b0fb07e04a8330ef3f5369cca86"},"schema_version":"1.0","source":{"id":"1712.00227","kind":"arxiv","version":3}},"canonical_sha256":"a116b42010da94d1c4b2ed9a11b8762ef24a43f063b35ccf3b354e4cf7b29b2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a116b42010da94d1c4b2ed9a11b8762ef24a43f063b35ccf3b354e4cf7b29b2f","first_computed_at":"2026-05-17T23:54:07.512009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:07.512009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ds2UYRDqjTye1AITa3DX0oNLQrm77rvha1smy67NWNz2A6SbnykbQ8aVKduPL9RofDULSsoJL0Gsj/2B43MsBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:07.512446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00227","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32286169231b91f87215da70a6e02f3f3427bb824ff02e82772693292babc86c","sha256:82ddca993aa44c9995c3453de43a9dd98903d91c336d32f48153440103958158"],"state_sha256":"a9235d3a5259e5bc6fed2ef7459c7d8763bd8b9b359b6676e52d18ceb9587cb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JzMwOKndWBirMaGjxKyePi4HeBJ1nqR8bacR/520PzhMYCcr1gCA9OeyTIT4jT6ZyJ/MDHy9cd+c9xRwa/yXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:20:20.005750Z","bundle_sha256":"d2c1745231b91d6848347565fb184caf247acdf48b93e56caaaf01b373f7850b"}}