{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JTVLMIQS7RE7HNAYJZGXYHMT3E","short_pith_number":"pith:JTVLMIQS","schema_version":"1.0","canonical_sha256":"4ceab62212fc49f3b4184e4d7c1d93d901ea112ab33e67eda2946e87965bce20","source":{"kind":"arxiv","id":"1711.05406","version":3},"attestation_state":"computed","paper":{"title":"A Fast and Robust TSVM for Pattern Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bin-Bin Gao, Jian-Jun Wang","submitted_at":"2017-11-15T04:48:14Z","abstract_excerpt":"Twin support vector machine~(TSVM) is a powerful learning algorithm by solving a pair of smaller SVM-type problems. However, there are still some specific issues such as low efficiency and weak robustness when it is faced with some real applications. In this paper, we propose a Fast and Robust TSVM~(FR-TSVM) to deal with the above issues. In order to alleviate the effects of noisy inputs, we propose an effective fuzzy membership function and reformulate the TSVMs such that different input instances can make different contributions to the learning of the separating hyperplanes. To further speed"},"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":"1711.05406","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-15T04:48:14Z","cross_cats_sorted":[],"title_canon_sha256":"7cfb073c3f27f725c60c7a2eaf4008161f30aae5c860339a8da5957a4b2cfe5a","abstract_canon_sha256":"ae825488f5bf5ac4159a3c78a7766071986705dc7b3b86ae21acb9e146ef0730"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:27.697430Z","signature_b64":"/n3QV8sVm9zGNAS5+xerGvz5bc4fVuF2UyvJCZyWrP/CGKq4VuXJT7GeVNVCmseFy7p5/nTiziPSVgt4asizCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ceab62212fc49f3b4184e4d7c1d93d901ea112ab33e67eda2946e87965bce20","last_reissued_at":"2026-05-17T23:39:27.696616Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:27.696616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast and Robust TSVM for Pattern Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bin-Bin Gao, Jian-Jun Wang","submitted_at":"2017-11-15T04:48:14Z","abstract_excerpt":"Twin support vector machine~(TSVM) is a powerful learning algorithm by solving a pair of smaller SVM-type problems. However, there are still some specific issues such as low efficiency and weak robustness when it is faced with some real applications. In this paper, we propose a Fast and Robust TSVM~(FR-TSVM) to deal with the above issues. In order to alleviate the effects of noisy inputs, we propose an effective fuzzy membership function and reformulate the TSVMs such that different input instances can make different contributions to the learning of the separating hyperplanes. To further speed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05406","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.05406","created_at":"2026-05-17T23:39:27.696766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.05406v3","created_at":"2026-05-17T23:39:27.696766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05406","created_at":"2026-05-17T23:39:27.696766+00:00"},{"alias_kind":"pith_short_12","alias_value":"JTVLMIQS7RE7","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JTVLMIQS7RE7HNAY","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JTVLMIQS","created_at":"2026-05-18T12:31:24.725408+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/JTVLMIQS7RE7HNAYJZGXYHMT3E","json":"https://pith.science/pith/JTVLMIQS7RE7HNAYJZGXYHMT3E.json","graph_json":"https://pith.science/api/pith-number/JTVLMIQS7RE7HNAYJZGXYHMT3E/graph.json","events_json":"https://pith.science/api/pith-number/JTVLMIQS7RE7HNAYJZGXYHMT3E/events.json","paper":"https://pith.science/paper/JTVLMIQS"},"agent_actions":{"view_html":"https://pith.science/pith/JTVLMIQS7RE7HNAYJZGXYHMT3E","download_json":"https://pith.science/pith/JTVLMIQS7RE7HNAYJZGXYHMT3E.json","view_paper":"https://pith.science/paper/JTVLMIQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.05406&json=true","fetch_graph":"https://pith.science/api/pith-number/JTVLMIQS7RE7HNAYJZGXYHMT3E/graph.json","fetch_events":"https://pith.science/api/pith-number/JTVLMIQS7RE7HNAYJZGXYHMT3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JTVLMIQS7RE7HNAYJZGXYHMT3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JTVLMIQS7RE7HNAYJZGXYHMT3E/action/storage_attestation","attest_author":"https://pith.science/pith/JTVLMIQS7RE7HNAYJZGXYHMT3E/action/author_attestation","sign_citation":"https://pith.science/pith/JTVLMIQS7RE7HNAYJZGXYHMT3E/action/citation_signature","submit_replication":"https://pith.science/pith/JTVLMIQS7RE7HNAYJZGXYHMT3E/action/replication_record"}},"created_at":"2026-05-17T23:39:27.696766+00:00","updated_at":"2026-05-17T23:39:27.696766+00:00"}