{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IR3IUOQBL7S53N7OLPUSPKIGJI","short_pith_number":"pith:IR3IUOQB","canonical_record":{"source":{"id":"1906.06090","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-06-14T09:28:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c7ba3caac1c1be67422d8e1d5058a87840109697bf1b7d99cd1eebd622e8d9bf","abstract_canon_sha256":"1f2023b7d9b810cddee98ced00e0ef41e5f27516b12a2034ba2c19e6b099e5e1"},"schema_version":"1.0"},"canonical_sha256":"44768a3a015fe5ddb7ee5be927a9064a0d4a97c612c5e714082cfce5140f59d7","source":{"kind":"arxiv","id":"1906.06090","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06090","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06090v2","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06090","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"pith_short_12","alias_value":"IR3IUOQBL7S5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IR3IUOQBL7S53N7O","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IR3IUOQB","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IR3IUOQBL7S53N7OLPUSPKIGJI","target":"record","payload":{"canonical_record":{"source":{"id":"1906.06090","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-06-14T09:28:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c7ba3caac1c1be67422d8e1d5058a87840109697bf1b7d99cd1eebd622e8d9bf","abstract_canon_sha256":"1f2023b7d9b810cddee98ced00e0ef41e5f27516b12a2034ba2c19e6b099e5e1"},"schema_version":"1.0"},"canonical_sha256":"44768a3a015fe5ddb7ee5be927a9064a0d4a97c612c5e714082cfce5140f59d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:32.220589Z","signature_b64":"3P0KecKOpDNf+H8D4ecaP4umMaltV4b1MrwGjmkeFsFxr08ffL/uGGLdAzejm3MCNPeQ10H6tYRoTsxSRVyUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44768a3a015fe5ddb7ee5be927a9064a0d4a97c612c5e714082cfce5140f59d7","last_reissued_at":"2026-05-17T23:42:32.220076Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:32.220076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.06090","source_version":2,"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-17T23:42:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7dP7ps56oPyz5PMjLzCNPhUgdR8qL8qQ6fjCeemk+pEeuOoOSuBJsVYiXTmGmeschTv7iEK+IW4ByrMCYbrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:07:29.243284Z"},"content_sha256":"be41d95fba146e0d47fd2e57a431e09575c2129b631bd1094fc2b95653aa1fe7","schema_version":"1.0","event_id":"sha256:be41d95fba146e0d47fd2e57a431e09575c2129b631bd1094fc2b95653aa1fe7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IR3IUOQBL7S53N7OLPUSPKIGJI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary Classification using Pairs of Minimum Spanning Trees or N-ary Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro Calefati, Dimitri Ognibene, Ignazio Gallo, Riccardo La Grassa","submitted_at":"2019-06-14T09:28:10Z","abstract_excerpt":"One-class classifiers are trained with target class only samples. Intuitively, their conservative modelling of the class description may benefit classical classification tasks where classes are difficult to separate due to overlapping and data imbalance. In this work, three methods are proposed which leverage on the combination of one-class classifiers based on non-parametric models, N-ary Trees and Minimum Spanning Trees class descriptors (MST-CD), to tackle binary classification problems. The methods deal with the inconsistencies arising from combining multiple classifiers and with spurious "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06090","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"},"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-17T23:42:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m3JBHxxxBM1FF0E2KZkOJK/XlX5uQo4koER7m6e+BSoWTmBC2CoUOpQ9oEMh8270ccYdSBETCXNYYXH+8C6RDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:07:29.243655Z"},"content_sha256":"2365f75b0289f3fb4b094302de58bfd0de391d0c02ebf3fdefae68f720398690","schema_version":"1.0","event_id":"sha256:2365f75b0289f3fb4b094302de58bfd0de391d0c02ebf3fdefae68f720398690"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IR3IUOQBL7S53N7OLPUSPKIGJI/bundle.json","state_url":"https://pith.science/pith/IR3IUOQBL7S53N7OLPUSPKIGJI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IR3IUOQBL7S53N7OLPUSPKIGJI/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-06-02T15:07:29Z","links":{"resolver":"https://pith.science/pith/IR3IUOQBL7S53N7OLPUSPKIGJI","bundle":"https://pith.science/pith/IR3IUOQBL7S53N7OLPUSPKIGJI/bundle.json","state":"https://pith.science/pith/IR3IUOQBL7S53N7OLPUSPKIGJI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IR3IUOQBL7S53N7OLPUSPKIGJI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IR3IUOQBL7S53N7OLPUSPKIGJI","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":"1f2023b7d9b810cddee98ced00e0ef41e5f27516b12a2034ba2c19e6b099e5e1","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-06-14T09:28:10Z","title_canon_sha256":"c7ba3caac1c1be67422d8e1d5058a87840109697bf1b7d99cd1eebd622e8d9bf"},"schema_version":"1.0","source":{"id":"1906.06090","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06090","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06090v2","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06090","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"pith_short_12","alias_value":"IR3IUOQBL7S5","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IR3IUOQBL7S53N7O","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IR3IUOQB","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:2365f75b0289f3fb4b094302de58bfd0de391d0c02ebf3fdefae68f720398690","target":"graph","created_at":"2026-05-17T23:42:32Z","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":"One-class classifiers are trained with target class only samples. Intuitively, their conservative modelling of the class description may benefit classical classification tasks where classes are difficult to separate due to overlapping and data imbalance. In this work, three methods are proposed which leverage on the combination of one-class classifiers based on non-parametric models, N-ary Trees and Minimum Spanning Trees class descriptors (MST-CD), to tackle binary classification problems. The methods deal with the inconsistencies arising from combining multiple classifiers and with spurious ","authors_text":"Alessandro Calefati, Dimitri Ognibene, Ignazio Gallo, Riccardo La Grassa","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-06-14T09:28:10Z","title":"Binary Classification using Pairs of Minimum Spanning Trees or N-ary Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06090","kind":"arxiv","version":2},"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:be41d95fba146e0d47fd2e57a431e09575c2129b631bd1094fc2b95653aa1fe7","target":"record","created_at":"2026-05-17T23:42:32Z","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":"1f2023b7d9b810cddee98ced00e0ef41e5f27516b12a2034ba2c19e6b099e5e1","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-06-14T09:28:10Z","title_canon_sha256":"c7ba3caac1c1be67422d8e1d5058a87840109697bf1b7d99cd1eebd622e8d9bf"},"schema_version":"1.0","source":{"id":"1906.06090","kind":"arxiv","version":2}},"canonical_sha256":"44768a3a015fe5ddb7ee5be927a9064a0d4a97c612c5e714082cfce5140f59d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44768a3a015fe5ddb7ee5be927a9064a0d4a97c612c5e714082cfce5140f59d7","first_computed_at":"2026-05-17T23:42:32.220076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:32.220076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3P0KecKOpDNf+H8D4ecaP4umMaltV4b1MrwGjmkeFsFxr08ffL/uGGLdAzejm3MCNPeQ10H6tYRoTsxSRVyUBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:32.220589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.06090","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be41d95fba146e0d47fd2e57a431e09575c2129b631bd1094fc2b95653aa1fe7","sha256:2365f75b0289f3fb4b094302de58bfd0de391d0c02ebf3fdefae68f720398690"],"state_sha256":"a8f07eb3b772faac7bd5d8dfea908d7a88c09b5e15e65eff7b19caed68e8ef76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2V9jRvCCkHv1ZgUR/J7jNxfbHv+STp4m/Fg2LQIXoSgCAJwq3vDRJLmHU5pY1YTekxhhKKvP1N+RyNKG2sE3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:07:29.245856Z","bundle_sha256":"d9ce7f1c3521392ba96bf820a849a43835fd1ad1e71ce9497117250c6dba9903"}}