{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:K3L7UTYAFDW42VPF6SJBWHRIK5","short_pith_number":"pith:K3L7UTYA","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"},"canonical_sha256":"56d7fa4f0028edcd55e5f4921b1e28577f4bd5885163c33c492a2b2c565dac26","source":{"kind":"arxiv","id":"1505.05451","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05451","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05451v3","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05451","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"K3L7UTYAFDW4","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"K3L7UTYAFDW42VPF","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"K3L7UTYA","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:K3L7UTYAFDW42VPF6SJBWHRIK5","target":"record","payload":{"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"},"canonical_sha256":"56d7fa4f0028edcd55e5f4921b1e28577f4bd5885163c33c492a2b2c565dac26","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"},"source_kind":"arxiv","source_id":"1505.05451","source_version":3,"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-18T00:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFzo+4FYVrPtdHraNHSXNiDSTDOApUeffIyvxoiIuqsK9QGE2LIt4Diphg5eJEclJasytA52Ot9Q8gk6Y/dNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:28:36.331625Z"},"content_sha256":"10377652cd3bb4643480b155430f1b50b42440cfcc6886f599ea01497f5b4c25","schema_version":"1.0","event_id":"sha256:10377652cd3bb4643480b155430f1b50b42440cfcc6886f599ea01497f5b4c25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:K3L7UTYAFDW42VPF6SJBWHRIK5","target":"graph","payload":{"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"},"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-18T00:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/qpALOtN1KeHAjSwttMcoghaBzYWc6vIyrFpno1/7/NFlM9hPTcBtjiHBEMo5i7ad9ZEduA5DJ3+y5OXvlEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:28:36.332270Z"},"content_sha256":"cc099e43b33a0ac76cb347a4bbf7a4dca13178c6d03261352f2c8635eba3f17a","schema_version":"1.0","event_id":"sha256:cc099e43b33a0ac76cb347a4bbf7a4dca13178c6d03261352f2c8635eba3f17a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K3L7UTYAFDW42VPF6SJBWHRIK5/bundle.json","state_url":"https://pith.science/pith/K3L7UTYAFDW42VPF6SJBWHRIK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K3L7UTYAFDW42VPF6SJBWHRIK5/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-05-31T14:28:36Z","links":{"resolver":"https://pith.science/pith/K3L7UTYAFDW42VPF6SJBWHRIK5","bundle":"https://pith.science/pith/K3L7UTYAFDW42VPF6SJBWHRIK5/bundle.json","state":"https://pith.science/pith/K3L7UTYAFDW42VPF6SJBWHRIK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K3L7UTYAFDW42VPF6SJBWHRIK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:K3L7UTYAFDW42VPF6SJBWHRIK5","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":"d0e713832c26f76f435d0cc716f19a831bc581d920b285b7c494ecd6fd62fbbc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-05-20T16:57:02Z","title_canon_sha256":"effd8fab5fc0f098ca0fa99415beb7669cd49dab593f4f0077da2461dc209c90"},"schema_version":"1.0","source":{"id":"1505.05451","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05451","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05451v3","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05451","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"K3L7UTYAFDW4","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"K3L7UTYAFDW42VPF","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"K3L7UTYA","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:cc099e43b33a0ac76cb347a4bbf7a4dca13178c6d03261352f2c8635eba3f17a","target":"graph","created_at":"2026-05-18T00:00:09Z","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":"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","authors_text":"Homayun Afrabandpey, Javad Salimi Sartakhti, Nasser Ghadiri","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-05-20T16:57:02Z","title":"Fuzzy Least Squares Twin Support Vector Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05451","kind":"arxiv","version":3},"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:10377652cd3bb4643480b155430f1b50b42440cfcc6886f599ea01497f5b4c25","target":"record","created_at":"2026-05-18T00:00:09Z","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":"d0e713832c26f76f435d0cc716f19a831bc581d920b285b7c494ecd6fd62fbbc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-05-20T16:57:02Z","title_canon_sha256":"effd8fab5fc0f098ca0fa99415beb7669cd49dab593f4f0077da2461dc209c90"},"schema_version":"1.0","source":{"id":"1505.05451","kind":"arxiv","version":3}},"canonical_sha256":"56d7fa4f0028edcd55e5f4921b1e28577f4bd5885163c33c492a2b2c565dac26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56d7fa4f0028edcd55e5f4921b1e28577f4bd5885163c33c492a2b2c565dac26","first_computed_at":"2026-05-18T00:00:09.669109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:09.669109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CGq9ySUL0I6OSBJzK2MfzgCbCcIMfiS/X0LQrKcpF+IP9TvQbWC0vO1/2+qStt+UGTlj0UlTXhp7O43f8HU7DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:09.669698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.05451","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10377652cd3bb4643480b155430f1b50b42440cfcc6886f599ea01497f5b4c25","sha256:cc099e43b33a0ac76cb347a4bbf7a4dca13178c6d03261352f2c8635eba3f17a"],"state_sha256":"1e7d9dd482db8338978a955ee5e6b32bed0fa52c9c30f8a8edc416f298eb64b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/F6pHiHs/zOslvDyBc3fdmht6dPvy0IeEjSXCkp7ff4fVSgbLGfVNMuaLJOpSJZYsGBC92tG6JShliH5BbiDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:28:36.336288Z","bundle_sha256":"130c3e7fdf036502f5cbe80a5eebfa4f5bd811f5ed91bd7d9cf5d72e8c707efd"}}