{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FSNPEJVOBXIPRONO4V3E535UMB","short_pith_number":"pith:FSNPEJVO","schema_version":"1.0","canonical_sha256":"2c9af226ae0dd0f8b9aee5764eefb46050620bd3ab5f6575d18c414f78e4d25a","source":{"kind":"arxiv","id":"1803.02541","version":1},"attestation_state":"computed","paper":{"title":"Nonstationary relaxed multisplitting methods for solving linear complementarity problems with H-matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Chenliang Li, Cuiyu Liu","submitted_at":"2018-03-07T06:55:03Z","abstract_excerpt":"In this paper we consider some non-stationary relaxed synchronous and asynchronous multi-splitting methods for solving the linear complementarity problems with their coefficient matrices being H-matrices. The convergence theorems of the methods are given,and the efficiency is shown by numerical tests."},"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":"1803.02541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-03-07T06:55:03Z","cross_cats_sorted":[],"title_canon_sha256":"87552eb0a77ed935d806f39c46f79f515b8cad000c00cdb4a4cac316edb82870","abstract_canon_sha256":"9d492f03d3580c093f9b3ffbf7f48459ee53b42d4b0d52959126082825c11224"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:49.902077Z","signature_b64":"tLwq0tZ+ZDBMLMEZAJzZZmtYjQ+m/c1+c84Dx5CClspWtz76S3uSD0KnctvUHuj0ZPn2vWg/XfIbniiUiQQfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c9af226ae0dd0f8b9aee5764eefb46050620bd3ab5f6575d18c414f78e4d25a","last_reissued_at":"2026-05-18T00:21:49.901424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:49.901424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonstationary relaxed multisplitting methods for solving linear complementarity problems with H-matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Chenliang Li, Cuiyu Liu","submitted_at":"2018-03-07T06:55:03Z","abstract_excerpt":"In this paper we consider some non-stationary relaxed synchronous and asynchronous multi-splitting methods for solving the linear complementarity problems with their coefficient matrices being H-matrices. The convergence theorems of the methods are given,and the efficiency is shown by numerical tests."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02541","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":"1803.02541","created_at":"2026-05-18T00:21:49.901545+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.02541v1","created_at":"2026-05-18T00:21:49.901545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02541","created_at":"2026-05-18T00:21:49.901545+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSNPEJVOBXIP","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSNPEJVOBXIPRONO","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSNPEJVO","created_at":"2026-05-18T12:32:25.280505+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/FSNPEJVOBXIPRONO4V3E535UMB","json":"https://pith.science/pith/FSNPEJVOBXIPRONO4V3E535UMB.json","graph_json":"https://pith.science/api/pith-number/FSNPEJVOBXIPRONO4V3E535UMB/graph.json","events_json":"https://pith.science/api/pith-number/FSNPEJVOBXIPRONO4V3E535UMB/events.json","paper":"https://pith.science/paper/FSNPEJVO"},"agent_actions":{"view_html":"https://pith.science/pith/FSNPEJVOBXIPRONO4V3E535UMB","download_json":"https://pith.science/pith/FSNPEJVOBXIPRONO4V3E535UMB.json","view_paper":"https://pith.science/paper/FSNPEJVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.02541&json=true","fetch_graph":"https://pith.science/api/pith-number/FSNPEJVOBXIPRONO4V3E535UMB/graph.json","fetch_events":"https://pith.science/api/pith-number/FSNPEJVOBXIPRONO4V3E535UMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSNPEJVOBXIPRONO4V3E535UMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSNPEJVOBXIPRONO4V3E535UMB/action/storage_attestation","attest_author":"https://pith.science/pith/FSNPEJVOBXIPRONO4V3E535UMB/action/author_attestation","sign_citation":"https://pith.science/pith/FSNPEJVOBXIPRONO4V3E535UMB/action/citation_signature","submit_replication":"https://pith.science/pith/FSNPEJVOBXIPRONO4V3E535UMB/action/replication_record"}},"created_at":"2026-05-18T00:21:49.901545+00:00","updated_at":"2026-05-18T00:21:49.901545+00:00"}