{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TIK6EUZSHHVCLB7I2Q323EBJFP","short_pith_number":"pith:TIK6EUZS","schema_version":"1.0","canonical_sha256":"9a15e2533239ea2587e8d437ad90292bf0a4ce861db6afe80bbabf86bf6fb190","source":{"kind":"arxiv","id":"1505.00993","version":1},"attestation_state":"computed","paper":{"title":"The Sparsest Solutions to $Z$-Tensor Complementarity Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.SP","authors_text":"Liqun Qi, Naihua Xiu, Ziyan Luo","submitted_at":"2015-05-05T13:03:29Z","abstract_excerpt":"Finding the sparsest solutions to a tensor complementarity problem is generally NP-hard due to the nonconvexity and noncontinuity of the involved $\\ell_0$ norm. In this paper, a special type of tensor complementarity problems with $Z$-tensors has been considered. Under some mild conditions, we show that to pursuit the sparsest solutions is equivalent to solving polynomial programming with a linear objective function. The involved conditions guarantee the desired exact relaxation and also allow to achieve a global optimal solution to the relaxed nonconvex polynomial programming problem. Particu"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1505.00993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2015-05-05T13:03:29Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"002261cbd63bc94085304848f9472faa9224b5a705d551bc2bc3fa639f9b5d0c","abstract_canon_sha256":"4297590e69b7031c7cb17ca5ebddccf330d63f9dc0196df95bb26446d1e26129"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:52.235210Z","signature_b64":"6xDLRfSHEhdLcq5UFu5v0i8Q/8MKkt1UyaT2Wy9e48A1wMfPlJOOOE4jcONIByfHAqwakp4bUhASUXJUKJURBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a15e2533239ea2587e8d437ad90292bf0a4ce861db6afe80bbabf86bf6fb190","last_reissued_at":"2026-05-18T02:16:52.234548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:52.234548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Sparsest Solutions to $Z$-Tensor Complementarity Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.SP","authors_text":"Liqun Qi, Naihua Xiu, Ziyan Luo","submitted_at":"2015-05-05T13:03:29Z","abstract_excerpt":"Finding the sparsest solutions to a tensor complementarity problem is generally NP-hard due to the nonconvexity and noncontinuity of the involved $\\ell_0$ norm. In this paper, a special type of tensor complementarity problems with $Z$-tensors has been considered. Under some mild conditions, we show that to pursuit the sparsest solutions is equivalent to solving polynomial programming with a linear objective function. The involved conditions guarantee the desired exact relaxation and also allow to achieve a global optimal solution to the relaxed nonconvex polynomial programming problem. Particu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00993","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.00993","created_at":"2026-05-18T02:16:52.234650+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00993v1","created_at":"2026-05-18T02:16:52.234650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00993","created_at":"2026-05-18T02:16:52.234650+00:00"},{"alias_kind":"pith_short_12","alias_value":"TIK6EUZSHHVC","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TIK6EUZSHHVCLB7I","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TIK6EUZS","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TIK6EUZSHHVCLB7I2Q323EBJFP","json":"https://pith.science/pith/TIK6EUZSHHVCLB7I2Q323EBJFP.json","graph_json":"https://pith.science/api/pith-number/TIK6EUZSHHVCLB7I2Q323EBJFP/graph.json","events_json":"https://pith.science/api/pith-number/TIK6EUZSHHVCLB7I2Q323EBJFP/events.json","paper":"https://pith.science/paper/TIK6EUZS"},"agent_actions":{"view_html":"https://pith.science/pith/TIK6EUZSHHVCLB7I2Q323EBJFP","download_json":"https://pith.science/pith/TIK6EUZSHHVCLB7I2Q323EBJFP.json","view_paper":"https://pith.science/paper/TIK6EUZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00993&json=true","fetch_graph":"https://pith.science/api/pith-number/TIK6EUZSHHVCLB7I2Q323EBJFP/graph.json","fetch_events":"https://pith.science/api/pith-number/TIK6EUZSHHVCLB7I2Q323EBJFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TIK6EUZSHHVCLB7I2Q323EBJFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TIK6EUZSHHVCLB7I2Q323EBJFP/action/storage_attestation","attest_author":"https://pith.science/pith/TIK6EUZSHHVCLB7I2Q323EBJFP/action/author_attestation","sign_citation":"https://pith.science/pith/TIK6EUZSHHVCLB7I2Q323EBJFP/action/citation_signature","submit_replication":"https://pith.science/pith/TIK6EUZSHHVCLB7I2Q323EBJFP/action/replication_record"}},"created_at":"2026-05-18T02:16:52.234650+00:00","updated_at":"2026-05-18T02:16:52.234650+00:00"}