{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2DQOOKDJXJI2WDNJFN3YEEQCIK","short_pith_number":"pith:2DQOOKDJ","schema_version":"1.0","canonical_sha256":"d0e0e72869ba51ab0da92b7782120242adb68dcb3389bd889c1a3feda93226c5","source":{"kind":"arxiv","id":"1706.06214","version":2},"attestation_state":"computed","paper":{"title":"On the combinatorics of the 2-class classification problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Diego Delle Donne, Javier Marenco, Ricardo C. Corr\\^ea","submitted_at":"2017-06-19T23:25:44Z","abstract_excerpt":"A set of points $X = X_B \\cup X_R \\subseteq \\mathbb{R}^d$ is linearly separable if the convex hulls of $X_B$ and $X_R$ are disjoint, hence there exists a hyperplane separating $X_B$ from $X_R$. Such a hyperplane provides a method for classifying new points, according to which side of the hyperplane the new points lie. When such a linear separation is not possible, it may still be possible to partition $X_B$ and $X_R$ into prespecified numbers of groups, in such a way that every group from $X_B$ is linearly separable from every group from $X_R$. We may also discard some points as outliers, and "},"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":"1706.06214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-06-19T23:25:44Z","cross_cats_sorted":[],"title_canon_sha256":"c1532a16af1c84a786cd14dc6945aadf8929cb78bd783686948b50dd102c3289","abstract_canon_sha256":"de1cac61a353e7740ec9efaa9bbe458815cf6e02a263dc7e4007047e41485c6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:09.452525Z","signature_b64":"jkA2SQpchlWRayeQHxQDW9WWczO+HFzcuZSzWpMExy3LNC4N0krP8L4YzYbPR/VRtImWrsZBEZ4tUJBTHaqFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0e0e72869ba51ab0da92b7782120242adb68dcb3389bd889c1a3feda93226c5","last_reissued_at":"2026-05-18T00:27:09.451857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:09.451857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the combinatorics of the 2-class classification problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Diego Delle Donne, Javier Marenco, Ricardo C. Corr\\^ea","submitted_at":"2017-06-19T23:25:44Z","abstract_excerpt":"A set of points $X = X_B \\cup X_R \\subseteq \\mathbb{R}^d$ is linearly separable if the convex hulls of $X_B$ and $X_R$ are disjoint, hence there exists a hyperplane separating $X_B$ from $X_R$. Such a hyperplane provides a method for classifying new points, according to which side of the hyperplane the new points lie. When such a linear separation is not possible, it may still be possible to partition $X_B$ and $X_R$ into prespecified numbers of groups, in such a way that every group from $X_B$ is linearly separable from every group from $X_R$. We may also discard some points as outliers, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06214","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":"1706.06214","created_at":"2026-05-18T00:27:09.451940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06214v2","created_at":"2026-05-18T00:27:09.451940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06214","created_at":"2026-05-18T00:27:09.451940+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DQOOKDJXJI2","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DQOOKDJXJI2WDNJ","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DQOOKDJ","created_at":"2026-05-18T12:30:55.937587+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/2DQOOKDJXJI2WDNJFN3YEEQCIK","json":"https://pith.science/pith/2DQOOKDJXJI2WDNJFN3YEEQCIK.json","graph_json":"https://pith.science/api/pith-number/2DQOOKDJXJI2WDNJFN3YEEQCIK/graph.json","events_json":"https://pith.science/api/pith-number/2DQOOKDJXJI2WDNJFN3YEEQCIK/events.json","paper":"https://pith.science/paper/2DQOOKDJ"},"agent_actions":{"view_html":"https://pith.science/pith/2DQOOKDJXJI2WDNJFN3YEEQCIK","download_json":"https://pith.science/pith/2DQOOKDJXJI2WDNJFN3YEEQCIK.json","view_paper":"https://pith.science/paper/2DQOOKDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06214&json=true","fetch_graph":"https://pith.science/api/pith-number/2DQOOKDJXJI2WDNJFN3YEEQCIK/graph.json","fetch_events":"https://pith.science/api/pith-number/2DQOOKDJXJI2WDNJFN3YEEQCIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DQOOKDJXJI2WDNJFN3YEEQCIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DQOOKDJXJI2WDNJFN3YEEQCIK/action/storage_attestation","attest_author":"https://pith.science/pith/2DQOOKDJXJI2WDNJFN3YEEQCIK/action/author_attestation","sign_citation":"https://pith.science/pith/2DQOOKDJXJI2WDNJFN3YEEQCIK/action/citation_signature","submit_replication":"https://pith.science/pith/2DQOOKDJXJI2WDNJFN3YEEQCIK/action/replication_record"}},"created_at":"2026-05-18T00:27:09.451940+00:00","updated_at":"2026-05-18T00:27:09.451940+00:00"}