{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:45ZPSF6D5RGJJEKGFC7SDP5HOP","short_pith_number":"pith:45ZPSF6D","canonical_record":{"source":{"id":"2606.21639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-19T17:48:15Z","cross_cats_sorted":["stat.ME","stat.ML"],"title_canon_sha256":"fdeb2984a600c9e651a0b3d930cab9fc0056c4d3f072b2632937a55746b700bd","abstract_canon_sha256":"28a0142a591ac6ee0559c943edbaa7f7b7c47ea3ac975fbde85e30145a133c96"},"schema_version":"1.0"},"canonical_sha256":"e772f917c3ec4c94914628bf21bfa773c2af45ab52898af7089353c501f9ce89","source":{"kind":"arxiv","id":"2606.21639","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21639","created_at":"2026-06-23T01:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21639v1","created_at":"2026-06-23T01:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21639","created_at":"2026-06-23T01:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"45ZPSF6D5RGJ","created_at":"2026-06-23T01:13:17Z"},{"alias_kind":"pith_short_16","alias_value":"45ZPSF6D5RGJJEKG","created_at":"2026-06-23T01:13:17Z"},{"alias_kind":"pith_short_8","alias_value":"45ZPSF6D","created_at":"2026-06-23T01:13:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:45ZPSF6D5RGJJEKGFC7SDP5HOP","target":"record","payload":{"canonical_record":{"source":{"id":"2606.21639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-19T17:48:15Z","cross_cats_sorted":["stat.ME","stat.ML"],"title_canon_sha256":"fdeb2984a600c9e651a0b3d930cab9fc0056c4d3f072b2632937a55746b700bd","abstract_canon_sha256":"28a0142a591ac6ee0559c943edbaa7f7b7c47ea3ac975fbde85e30145a133c96"},"schema_version":"1.0"},"canonical_sha256":"e772f917c3ec4c94914628bf21bfa773c2af45ab52898af7089353c501f9ce89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:13:17.548157Z","signature_b64":"s7vRdGF8GdNzGQ5Ytcv5QjR93sKYPn7xB+Fho07Yx2IuQkhepACFsgw9xiP2KJ2XHa71RacNIF/zyzb1+UQjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e772f917c3ec4c94914628bf21bfa773c2af45ab52898af7089353c501f9ce89","last_reissued_at":"2026-06-23T01:13:17.547712Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:13:17.547712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.21639","source_version":1,"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-06-23T01:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cstaxTQJTleNNOTpcVLYTwFZc3jUiE3BXsyI0tLtKNUaS2M6ElwrXyUy0hfnm1m3xmH+bsPnfKlHdi5fnwULBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:49:41.159597Z"},"content_sha256":"efca8541d3dd1c965fa827d064360f41d1cd79562f40987e76d33931783fc0d8","schema_version":"1.0","event_id":"sha256:efca8541d3dd1c965fa827d064360f41d1cd79562f40987e76d33931783fc0d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:45ZPSF6D5RGJJEKGFC7SDP5HOP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new classification method based on Minimum Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Beatriz Pateiro-L\\'opez, Iria Rodr\\'iguez-Acevedo, Julio Gonz\\'alez-D\\'iaz","submitted_at":"2026-06-19T17:48:15Z","abstract_excerpt":"Minimum Spanning Trees have been used in unsupervised learning, particularly in clustering tasks, due to their ability to recognize clusters by removing edges that are considered inconsistent in defining those clusters. This paper aims to study the use of Minimum Spanning Trees in supervised learning. Specifically, we propose a classification algorithm based on Minimum Spanning Trees. To improve its performance, we introduce a robust version of the method that is also computationally more efficient. We evaluate the effectiveness of our proposed method through an extensive simulation study. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21639","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.21639/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-23T01:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zlb/r/SnlsGFWwifuX98Ju5UkLrn8p3nP00PmfpQ/um2Aglqlfqhyijxky7NB3/li9JDnCOJLFwIVDTaRsTxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:49:41.159983Z"},"content_sha256":"b769e11aa0b4ec6b27898de8d0d3df02bd7d290befc80d2ffe3274024eb15d8c","schema_version":"1.0","event_id":"sha256:b769e11aa0b4ec6b27898de8d0d3df02bd7d290befc80d2ffe3274024eb15d8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/45ZPSF6D5RGJJEKGFC7SDP5HOP/bundle.json","state_url":"https://pith.science/pith/45ZPSF6D5RGJJEKGFC7SDP5HOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/45ZPSF6D5RGJJEKGFC7SDP5HOP/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-25T22:49:41Z","links":{"resolver":"https://pith.science/pith/45ZPSF6D5RGJJEKGFC7SDP5HOP","bundle":"https://pith.science/pith/45ZPSF6D5RGJJEKGFC7SDP5HOP/bundle.json","state":"https://pith.science/pith/45ZPSF6D5RGJJEKGFC7SDP5HOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/45ZPSF6D5RGJJEKGFC7SDP5HOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:45ZPSF6D5RGJJEKGFC7SDP5HOP","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":"28a0142a591ac6ee0559c943edbaa7f7b7c47ea3ac975fbde85e30145a133c96","cross_cats_sorted":["stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-19T17:48:15Z","title_canon_sha256":"fdeb2984a600c9e651a0b3d930cab9fc0056c4d3f072b2632937a55746b700bd"},"schema_version":"1.0","source":{"id":"2606.21639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21639","created_at":"2026-06-23T01:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21639v1","created_at":"2026-06-23T01:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21639","created_at":"2026-06-23T01:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"45ZPSF6D5RGJ","created_at":"2026-06-23T01:13:17Z"},{"alias_kind":"pith_short_16","alias_value":"45ZPSF6D5RGJJEKG","created_at":"2026-06-23T01:13:17Z"},{"alias_kind":"pith_short_8","alias_value":"45ZPSF6D","created_at":"2026-06-23T01:13:17Z"}],"graph_snapshots":[{"event_id":"sha256:b769e11aa0b4ec6b27898de8d0d3df02bd7d290befc80d2ffe3274024eb15d8c","target":"graph","created_at":"2026-06-23T01:13:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.21639/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Minimum Spanning Trees have been used in unsupervised learning, particularly in clustering tasks, due to their ability to recognize clusters by removing edges that are considered inconsistent in defining those clusters. This paper aims to study the use of Minimum Spanning Trees in supervised learning. Specifically, we propose a classification algorithm based on Minimum Spanning Trees. To improve its performance, we introduce a robust version of the method that is also computationally more efficient. We evaluate the effectiveness of our proposed method through an extensive simulation study. We ","authors_text":"Beatriz Pateiro-L\\'opez, Iria Rodr\\'iguez-Acevedo, Julio Gonz\\'alez-D\\'iaz","cross_cats":["stat.ME","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-19T17:48:15Z","title":"A new classification method based on Minimum Spanning Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21639","kind":"arxiv","version":1},"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:efca8541d3dd1c965fa827d064360f41d1cd79562f40987e76d33931783fc0d8","target":"record","created_at":"2026-06-23T01:13:17Z","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":"28a0142a591ac6ee0559c943edbaa7f7b7c47ea3ac975fbde85e30145a133c96","cross_cats_sorted":["stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-19T17:48:15Z","title_canon_sha256":"fdeb2984a600c9e651a0b3d930cab9fc0056c4d3f072b2632937a55746b700bd"},"schema_version":"1.0","source":{"id":"2606.21639","kind":"arxiv","version":1}},"canonical_sha256":"e772f917c3ec4c94914628bf21bfa773c2af45ab52898af7089353c501f9ce89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e772f917c3ec4c94914628bf21bfa773c2af45ab52898af7089353c501f9ce89","first_computed_at":"2026-06-23T01:13:17.547712Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T01:13:17.547712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s7vRdGF8GdNzGQ5Ytcv5QjR93sKYPn7xB+Fho07Yx2IuQkhepACFsgw9xiP2KJ2XHa71RacNIF/zyzb1+UQjCw==","signature_status":"signed_v1","signed_at":"2026-06-23T01:13:17.548157Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.21639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efca8541d3dd1c965fa827d064360f41d1cd79562f40987e76d33931783fc0d8","sha256:b769e11aa0b4ec6b27898de8d0d3df02bd7d290befc80d2ffe3274024eb15d8c"],"state_sha256":"ca3110ac60a21387f535d34eda12bb61e99269a5e473cbbac8167d2844a09f04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYKH0cXJp9bOfIFufV3wtXrhiV+P4DpZ5Gql+9cJFA3bo+mLxSkir3vlCzNUYGptDxmmJF2XmaWVgnEy9zbJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T22:49:41.162220Z","bundle_sha256":"73b4d690d914d521a8e2025133b4ee4a06b1fa13f30e1fd551e11367354be0db"}}