{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TIK6EUZSHHVCLB7I2Q323EBJFP","short_pith_number":"pith:TIK6EUZS","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"},"canonical_sha256":"9a15e2533239ea2587e8d437ad90292bf0a4ce861db6afe80bbabf86bf6fb190","source":{"kind":"arxiv","id":"1505.00993","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00993","created_at":"2026-05-18T02:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00993v1","created_at":"2026-05-18T02:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00993","created_at":"2026-05-18T02:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"TIK6EUZSHHVC","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TIK6EUZSHHVCLB7I","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TIK6EUZS","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TIK6EUZSHHVCLB7I2Q323EBJFP","target":"record","payload":{"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"},"canonical_sha256":"9a15e2533239ea2587e8d437ad90292bf0a4ce861db6afe80bbabf86bf6fb190","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"},"source_kind":"arxiv","source_id":"1505.00993","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-18T02:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"npkSj2vuLM5d9sCJu9XIOuA02/H26L0vjO5kzNodrSTj+euZ+QsdM5IO56ajNr8A1sTIZu97t6udl18aifluAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:22:38.420517Z"},"content_sha256":"b71cdb24bf2b0c46c3c2d575f4bfec70aa58b4fd9b18fdbb3b5f28f4defe2e88","schema_version":"1.0","event_id":"sha256:b71cdb24bf2b0c46c3c2d575f4bfec70aa58b4fd9b18fdbb3b5f28f4defe2e88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TIK6EUZSHHVCLB7I2Q323EBJFP","target":"graph","payload":{"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"},"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-18T02:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"txD0H+FLYmb2C0M8sj3C6/XWnbGcsWRaBMoLZu9FSw+/c6luKXdDE1RAC61Ul73UGTDKe+WhbAYEyVW/hffgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:22:38.420872Z"},"content_sha256":"e4ac2fb0cc601896b81ccfc2eb94cbe3250d3ad2dac680ea7aebadab8090e34a","schema_version":"1.0","event_id":"sha256:e4ac2fb0cc601896b81ccfc2eb94cbe3250d3ad2dac680ea7aebadab8090e34a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TIK6EUZSHHVCLB7I2Q323EBJFP/bundle.json","state_url":"https://pith.science/pith/TIK6EUZSHHVCLB7I2Q323EBJFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TIK6EUZSHHVCLB7I2Q323EBJFP/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-01T06:22:38Z","links":{"resolver":"https://pith.science/pith/TIK6EUZSHHVCLB7I2Q323EBJFP","bundle":"https://pith.science/pith/TIK6EUZSHHVCLB7I2Q323EBJFP/bundle.json","state":"https://pith.science/pith/TIK6EUZSHHVCLB7I2Q323EBJFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TIK6EUZSHHVCLB7I2Q323EBJFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TIK6EUZSHHVCLB7I2Q323EBJFP","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":"4297590e69b7031c7cb17ca5ebddccf330d63f9dc0196df95bb26446d1e26129","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2015-05-05T13:03:29Z","title_canon_sha256":"002261cbd63bc94085304848f9472faa9224b5a705d551bc2bc3fa639f9b5d0c"},"schema_version":"1.0","source":{"id":"1505.00993","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00993","created_at":"2026-05-18T02:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00993v1","created_at":"2026-05-18T02:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00993","created_at":"2026-05-18T02:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"TIK6EUZSHHVC","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TIK6EUZSHHVCLB7I","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TIK6EUZS","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:e4ac2fb0cc601896b81ccfc2eb94cbe3250d3ad2dac680ea7aebadab8090e34a","target":"graph","created_at":"2026-05-18T02:16:52Z","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":"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","authors_text":"Liqun Qi, Naihua Xiu, Ziyan Luo","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2015-05-05T13:03:29Z","title":"The Sparsest Solutions to $Z$-Tensor Complementarity Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00993","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:b71cdb24bf2b0c46c3c2d575f4bfec70aa58b4fd9b18fdbb3b5f28f4defe2e88","target":"record","created_at":"2026-05-18T02:16:52Z","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":"4297590e69b7031c7cb17ca5ebddccf330d63f9dc0196df95bb26446d1e26129","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2015-05-05T13:03:29Z","title_canon_sha256":"002261cbd63bc94085304848f9472faa9224b5a705d551bc2bc3fa639f9b5d0c"},"schema_version":"1.0","source":{"id":"1505.00993","kind":"arxiv","version":1}},"canonical_sha256":"9a15e2533239ea2587e8d437ad90292bf0a4ce861db6afe80bbabf86bf6fb190","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a15e2533239ea2587e8d437ad90292bf0a4ce861db6afe80bbabf86bf6fb190","first_computed_at":"2026-05-18T02:16:52.234548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:52.234548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6xDLRfSHEhdLcq5UFu5v0i8Q/8MKkt1UyaT2Wy9e48A1wMfPlJOOOE4jcONIByfHAqwakp4bUhASUXJUKJURBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:52.235210Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00993","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b71cdb24bf2b0c46c3c2d575f4bfec70aa58b4fd9b18fdbb3b5f28f4defe2e88","sha256:e4ac2fb0cc601896b81ccfc2eb94cbe3250d3ad2dac680ea7aebadab8090e34a"],"state_sha256":"8176e18338d749e55ee122755283fc76df01e3a54e4dd002bda12331b7c45043"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUwS9QCLR2URPneXP8nbGHsgyVRCqnI49ZEbRpnfIpbfzjg3gZhXovsz8ufYGfSXu5Rs5UAcagEIvUf22z2gCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:22:38.422917Z","bundle_sha256":"e7e35ac3fe99e10d5e01e4eb370a7064375a503cccbd7802df6e9740e459b616"}}