{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:K3L7UTYAFDW42VPF6SJBWHRIK5","short_pith_number":"pith:K3L7UTYA","schema_version":"1.0","canonical_sha256":"56d7fa4f0028edcd55e5f4921b1e28577f4bd5885163c33c492a2b2c565dac26","source":{"kind":"arxiv","id":"1505.05451","version":3},"attestation_state":"computed","paper":{"title":"Fuzzy Least Squares Twin Support Vector Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Homayun Afrabandpey, Javad Salimi Sartakhti, Nasser Ghadiri","submitted_at":"2015-05-20T16:57:02Z","abstract_excerpt":"Least Squares Twin Support Vector Machine (LST-SVM) has been shown to be an efficient and fast algorithm for binary classification. It combines the operating principles of Least Squares SVM (LS-SVM) and Twin SVM (T-SVM); it constructs two non-parallel hyperplanes (as in T-SVM) by solving two systems of linear equations (as in LS-SVM). Despite its efficiency, LST-SVM is still unable to cope with two features of real-world problems. First, in many real-world applications, labels of samples are not deterministic; they come naturally with their associated membership degrees. Second, samples in rea"},"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.05451","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-05-20T16:57:02Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"effd8fab5fc0f098ca0fa99415beb7669cd49dab593f4f0077da2461dc209c90","abstract_canon_sha256":"d0e713832c26f76f435d0cc716f19a831bc581d920b285b7c494ecd6fd62fbbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:09.669698Z","signature_b64":"CGq9ySUL0I6OSBJzK2MfzgCbCcIMfiS/X0LQrKcpF+IP9TvQbWC0vO1/2+qStt+UGTlj0UlTXhp7O43f8HU7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56d7fa4f0028edcd55e5f4921b1e28577f4bd5885163c33c492a2b2c565dac26","last_reissued_at":"2026-05-18T00:00:09.669109Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:09.669109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fuzzy Least Squares Twin Support Vector Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Homayun Afrabandpey, Javad Salimi Sartakhti, Nasser Ghadiri","submitted_at":"2015-05-20T16:57:02Z","abstract_excerpt":"Least Squares Twin Support Vector Machine (LST-SVM) has been shown to be an efficient and fast algorithm for binary classification. It combines the operating principles of Least Squares SVM (LS-SVM) and Twin SVM (T-SVM); it constructs two non-parallel hyperplanes (as in T-SVM) by solving two systems of linear equations (as in LS-SVM). Despite its efficiency, LST-SVM is still unable to cope with two features of real-world problems. First, in many real-world applications, labels of samples are not deterministic; they come naturally with their associated membership degrees. Second, samples in rea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05451","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":"1505.05451","created_at":"2026-05-18T00:00:09.669198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.05451v3","created_at":"2026-05-18T00:00:09.669198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05451","created_at":"2026-05-18T00:00:09.669198+00:00"},{"alias_kind":"pith_short_12","alias_value":"K3L7UTYAFDW4","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"K3L7UTYAFDW42VPF","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"K3L7UTYA","created_at":"2026-05-18T12:29:27.538025+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/K3L7UTYAFDW42VPF6SJBWHRIK5","json":"https://pith.science/pith/K3L7UTYAFDW42VPF6SJBWHRIK5.json","graph_json":"https://pith.science/api/pith-number/K3L7UTYAFDW42VPF6SJBWHRIK5/graph.json","events_json":"https://pith.science/api/pith-number/K3L7UTYAFDW42VPF6SJBWHRIK5/events.json","paper":"https://pith.science/paper/K3L7UTYA"},"agent_actions":{"view_html":"https://pith.science/pith/K3L7UTYAFDW42VPF6SJBWHRIK5","download_json":"https://pith.science/pith/K3L7UTYAFDW42VPF6SJBWHRIK5.json","view_paper":"https://pith.science/paper/K3L7UTYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.05451&json=true","fetch_graph":"https://pith.science/api/pith-number/K3L7UTYAFDW42VPF6SJBWHRIK5/graph.json","fetch_events":"https://pith.science/api/pith-number/K3L7UTYAFDW42VPF6SJBWHRIK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K3L7UTYAFDW42VPF6SJBWHRIK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K3L7UTYAFDW42VPF6SJBWHRIK5/action/storage_attestation","attest_author":"https://pith.science/pith/K3L7UTYAFDW42VPF6SJBWHRIK5/action/author_attestation","sign_citation":"https://pith.science/pith/K3L7UTYAFDW42VPF6SJBWHRIK5/action/citation_signature","submit_replication":"https://pith.science/pith/K3L7UTYAFDW42VPF6SJBWHRIK5/action/replication_record"}},"created_at":"2026-05-18T00:00:09.669198+00:00","updated_at":"2026-05-18T00:00:09.669198+00:00"}