{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4J2574V5KCCQPEBOARR22CTSQ5","short_pith_number":"pith:4J2574V5","schema_version":"1.0","canonical_sha256":"e275dff2bd508507902e0463ad0a7287717daf7c3d1d3264bac4460e698c9e07","source":{"kind":"arxiv","id":"1808.03021","version":2},"attestation_state":"computed","paper":{"title":"Gradient Dynamic Approach to the Tensor Complementarity Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Liqun Qi, Maolin Che, Xuezhong Wang, Yimin Wei","submitted_at":"2018-08-09T05:09:13Z","abstract_excerpt":"Nonlinear gradient dynamic approach for solving the tensor complementarity problem (TCP) is presented. Theoretical analysis shows that each of the defined dynamical system models ensures the convergence performance. The computer simulation results further substantiate that the considered dynamical system can solve the tensor complementarity problem (TCP)."},"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":"1808.03021","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-09T05:09:13Z","cross_cats_sorted":[],"title_canon_sha256":"1a2b1ab82540cef3bd13729793de8369ac51ad7b943039d00b6188e57550bd64","abstract_canon_sha256":"8f928ef5698deaf35a3fc19c1c730d3fca4be8cf1ff3b1bdd46adca6161f351a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:25.286638Z","signature_b64":"fgcNp1z0G265FxtOjg43ufwllb7JyRTs/QG3yR1yVbxCVOfco9fUiWKvf04R/gUfO5mEMKgFG/VB6drE3O+GAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e275dff2bd508507902e0463ad0a7287717daf7c3d1d3264bac4460e698c9e07","last_reissued_at":"2026-05-18T00:08:25.286197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:25.286197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient Dynamic Approach to the Tensor Complementarity Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Liqun Qi, Maolin Che, Xuezhong Wang, Yimin Wei","submitted_at":"2018-08-09T05:09:13Z","abstract_excerpt":"Nonlinear gradient dynamic approach for solving the tensor complementarity problem (TCP) is presented. Theoretical analysis shows that each of the defined dynamical system models ensures the convergence performance. The computer simulation results further substantiate that the considered dynamical system can solve the tensor complementarity problem (TCP)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03021","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.03021","created_at":"2026-05-18T00:08:25.286258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03021v2","created_at":"2026-05-18T00:08:25.286258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03021","created_at":"2026-05-18T00:08:25.286258+00:00"},{"alias_kind":"pith_short_12","alias_value":"4J2574V5KCCQ","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4J2574V5KCCQPEBO","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4J2574V5","created_at":"2026-05-18T12:32:05.422762+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/4J2574V5KCCQPEBOARR22CTSQ5","json":"https://pith.science/pith/4J2574V5KCCQPEBOARR22CTSQ5.json","graph_json":"https://pith.science/api/pith-number/4J2574V5KCCQPEBOARR22CTSQ5/graph.json","events_json":"https://pith.science/api/pith-number/4J2574V5KCCQPEBOARR22CTSQ5/events.json","paper":"https://pith.science/paper/4J2574V5"},"agent_actions":{"view_html":"https://pith.science/pith/4J2574V5KCCQPEBOARR22CTSQ5","download_json":"https://pith.science/pith/4J2574V5KCCQPEBOARR22CTSQ5.json","view_paper":"https://pith.science/paper/4J2574V5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03021&json=true","fetch_graph":"https://pith.science/api/pith-number/4J2574V5KCCQPEBOARR22CTSQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/4J2574V5KCCQPEBOARR22CTSQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4J2574V5KCCQPEBOARR22CTSQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4J2574V5KCCQPEBOARR22CTSQ5/action/storage_attestation","attest_author":"https://pith.science/pith/4J2574V5KCCQPEBOARR22CTSQ5/action/author_attestation","sign_citation":"https://pith.science/pith/4J2574V5KCCQPEBOARR22CTSQ5/action/citation_signature","submit_replication":"https://pith.science/pith/4J2574V5KCCQPEBOARR22CTSQ5/action/replication_record"}},"created_at":"2026-05-18T00:08:25.286258+00:00","updated_at":"2026-05-18T00:08:25.286258+00:00"}